Base | Representation |
---|---|
bin | 1001000001010011010… |
… | …1110010000110000000 |
3 | 112211000000111201122010 |
4 | 2100110311302012000 |
5 | 10014333411401132 |
6 | 155105212012520 |
7 | 14124156140160 |
oct | 2202465620600 |
9 | 484000451563 |
10 | 154968465792 |
11 | 5a7a3728028 |
12 | 2604a761140 |
13 | 117c8a1994a |
14 | 77015a45a0 |
15 | 406eda76cc |
hex | 2414d72180 |
154968465792 has 256 divisors, whose sum is σ = 480481689600. Its totient is φ = 43340064768.
The previous prime is 154968465749. The next prime is 154968465823. The reversal of 154968465792 is 297564869451.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29353009 + ... + 29358287.
It is an arithmetic number, because the mean of its divisors is an integer number (1876881600).
Almost surely, 2154968465792 is an apocalyptic number.
154968465792 is a gapful number since it is divisible by the number (12) 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 154968465792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (240240844800).
154968465792 is an abundant number, since it is smaller than the sum of its proper divisors (325513223808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154968465792 is a wasteful number, since it uses less digits than its factorization.
154968465792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5533 (or 5521 counting only the distinct ones).
The product of its digits is 130636800, while the sum is 66.
The spelling of 154968465792 in words is "one hundred fifty-four billion, nine hundred sixty-eight million, four hundred sixty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •