Base | Representation |
---|---|
bin | 1000111111000011010… |
… | …0101110110100000000 |
3 | 112202102220111101002222 |
4 | 2033300310232310000 |
5 | 10012114214213212 |
6 | 154525224430212 |
7 | 14103201065555 |
oct | 2176064566400 |
9 | 482386441088 |
10 | 154364210432 |
11 | 5a513633033 |
12 | 25b00318368 |
13 | 117307911b3 |
14 | 7685230a2c |
15 | 4036ce8c72 |
hex | 23f0d2ed00 |
154364210432 has 144 divisors (see below), whose sum is σ = 337983576000. Its totient is φ = 70081708032.
The previous prime is 154364210423. The next prime is 154364210449. The reversal of 154364210432 is 234012463451.
It is a junction number, because it is equal to n+sod(n) for n = 154364210392 and 154364210401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19602848 + ... + 19610720.
Almost surely, 2154364210432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 154364210432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168991788000).
154364210432 is an abundant number, since it is smaller than the sum of its proper divisors (183619365568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154364210432 is a wasteful number, since it uses less digits than its factorization.
154364210432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8076 (or 8062 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 154364210432 its reverse (234012463451), we get a palindrome (388376673883).
The spelling of 154364210432 in words is "one hundred fifty-four billion, three hundred sixty-four million, two hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •