Base | Representation |
---|---|
bin | 10110111110000010011010… |
… | …010101000011011001010000 |
3 | 111020200102211211020222220020 |
4 | 112332002122111003121100 |
5 | 101220103402310341422 |
6 | 554504014242143440 |
7 | 30164320140152022 |
oct | 2676023225033120 |
9 | 436612754228806 |
10 | 101020220012112 |
11 | 2a208486672485 |
12 | b3b648b351b80 |
13 | 444a22055c49b |
14 | 1ad3594852012 |
15 | ba2b7b26095c |
hex | 5be09a543650 |
101020220012112 has 80 divisors (see below), whose sum is σ = 274708166986560. Its totient is φ = 31900650633216.
The previous prime is 101020220012099. The next prime is 101020220012143. The reversal of 101020220012112 is 211210022020101.
It is a junction number, because it is equal to n+sod(n) for n = 101020220012091 and 101020220012100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63710728 + ... + 65277080.
It is an arithmetic number, because the mean of its divisors is an integer number (3433852087332).
Almost surely, 2101020220012112 is an apocalyptic number.
101020220012112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101020220012112 is an abundant number, since it is smaller than the sum of its proper divisors (173687946974448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020220012112 is a wasteful number, since it uses less digits than its factorization.
101020220012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1637100 (or 1637094 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101020220012112 its reverse (211210022020101), we get a palindrome (312230242032213).
The spelling of 101020220012112 in words is "one hundred one trillion, twenty billion, two hundred twenty million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •