Base | Representation |
---|---|
bin | 10110110010101010110111… |
… | …010111111010101100000000 |
3 | 111010220202102212201221000220 |
4 | 112302222313113322230000 |
5 | 101114304004423114042 |
6 | 553105101020343040 |
7 | 30054013304241000 |
oct | 2662526727725400 |
9 | 433822385657026 |
10 | 100239023254272 |
11 | 29a37149445941 |
12 | b2aabb20a4a80 |
13 | 43c166505cc06 |
14 | 1aa7847888000 |
15 | b8c6a8ade8ec |
hex | 5b2ab75fab00 |
100239023254272 has 288 divisors, whose sum is σ = 319524588096000. Its totient is φ = 27865671708672.
The previous prime is 100239023254261. The next prime is 100239023254367. The reversal of 100239023254272 is 272452320932001.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4604479 + ... + 14888897.
Almost surely, 2100239023254272 is an apocalyptic number.
100239023254272 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 100239023254272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159762294048000).
100239023254272 is an abundant number, since it is smaller than the sum of its proper divisors (219285564841728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100239023254272 is an equidigital number, since it uses as much as digits as its factorization.
100239023254272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10284496 (or 10284468 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 42.
The spelling of 100239023254272 in words is "one hundred trillion, two hundred thirty-nine billion, twenty-three million, two hundred fifty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •