Base | Representation |
---|---|
bin | 10110110011001001100101… |
… | …001101001000011100000000 |
3 | 111011000220120101122102201120 |
4 | 112303021211031020130000 |
5 | 101120324031113334124 |
6 | 553132153425432240 |
7 | 30056261513524650 |
oct | 2663114515103400 |
9 | 434026511572646 |
10 | 100272004433664 |
11 | 29a4a133465098 |
12 | b2b547749b680 |
13 | 43c47bcc49b8b |
14 | 1aa9295bda360 |
15 | b8d4892e0d79 |
hex | 5b3265348700 |
100272004433664 has 72 divisors (see below), whose sum is σ = 304994013502080. Its totient is φ = 28649144122368.
The previous prime is 100272004433603. The next prime is 100272004433669. The reversal of 100272004433664 is 466334400272001.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100272004433669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9325887894 + ... + 9325898645.
Almost surely, 2100272004433664 is an apocalyptic number.
100272004433664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
100272004433664 is an abundant number, since it is smaller than the sum of its proper divisors (204722009068416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100272004433664 is an equidigital number, since it uses as much as digits as its factorization.
100272004433664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18651786565 (or 18651786551 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 42.
The spelling of 100272004433664 in words is "one hundred trillion, two hundred seventy-two billion, four million, four hundred thirty-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •