Base | Representation |
---|---|
bin | 10001010010110… |
… | …11010111000000 |
3 | 101002222201012000 |
4 | 20221123113000 |
5 | 244114441241 |
6 | 22221304000 |
7 | 3411066021 |
oct | 1051332700 |
9 | 332881160 |
10 | 145077696 |
11 | 74990025 |
12 | 40705000 |
13 | 240975ba |
14 | 153a6c48 |
15 | cb0aeb6 |
hex | 8a5b5c0 |
145077696 has 112 divisors (see below), whose sum is σ = 434035200. Its totient is φ = 47506176.
The previous prime is 145077689. The next prime is 145077697. The reversal of 145077696 is 696770541.
It is a happy number.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145077697) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101241 + ... + 102663.
Almost surely, 2145077696 is an apocalyptic number.
145077696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 145077696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217017600).
145077696 is an abundant number, since it is smaller than the sum of its proper divisors (288957504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145077696 is a wasteful number, since it uses less digits than its factorization.
145077696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1503 (or 1487 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 45.
The square root of 145077696 is about 12044.8202975387. The cubic root of 145077696 is about 525.4526056123.
The spelling of 145077696 in words is "one hundred forty-five million, seventy-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •