Base | Representation |
---|---|
bin | 10110110010011100000010… |
… | …110111110010011110000000 |
3 | 111010212020100212012102211210 |
4 | 112302130002313302132000 |
5 | 101114023412131444412 |
6 | 553053510001010120 |
7 | 30052611045130506 |
oct | 2662340267623600 |
9 | 433766325172753 |
10 | 100223110031232 |
11 | 29a3042288a941 |
12 | b2a7ab0923940 |
13 | 43bccca26a8c6 |
14 | 1aa6b78264676 |
15 | b8c076a3a83c |
hex | 5b2702df2780 |
100223110031232 has 64 divisors (see below), whose sum is σ = 266225610142800. Its totient is φ = 33406702669824.
The previous prime is 100223110031227. The next prime is 100223110031257. The reversal of 100223110031232 is 232130011322001.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 100223110031199 and 100223110031208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8983018 + ... + 16767254.
Almost surely, 2100223110031232 is an apocalyptic number.
100223110031232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100223110031232 is an abundant number, since it is smaller than the sum of its proper divisors (166002500111568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100223110031232 is an equidigital number, since it uses as much as digits as its factorization.
100223110031232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7817783 (or 7817771 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 100223110031232 its reverse (232130011322001), we get a palindrome (332353121353233).
The spelling of 100223110031232 in words is "one hundred trillion, two hundred twenty-three billion, one hundred ten million, thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •