Base | Representation |
---|---|
bin | 10111000000111100101010… |
… | …001000000001010000100100 |
3 | 111021101120000211210021200120 |
4 | 113000330222020001100210 |
5 | 101231342432424311322 |
6 | 555135530213041540 |
7 | 30214626640454634 |
oct | 2700745210012044 |
9 | 437346024707616 |
10 | 101220201010212 |
11 | 2a285278735229 |
12 | b4291a06262b0 |
13 | 446304095761b |
14 | 1add1261c86c4 |
15 | ba7e82bcea5c |
hex | 5c0f2a201424 |
101220201010212 has 48 divisors (see below), whose sum is σ = 237688240249152. Its totient is φ = 33524677330560.
The previous prime is 101220201010199. The next prime is 101220201010223. The reversal of 101220201010212 is 212010102022101.
It is a junction number, because it is equal to n+sod(n) for n = 101220201010191 and 101220201010200.
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, 144214887 + ... + 144915057.
It is an arithmetic number, because the mean of its divisors is an integer number (4951838338524).
Almost surely, 2101220201010212 is an apocalyptic number.
101220201010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101220201010212 is an abundant number, since it is smaller than the sum of its proper divisors (136468039238940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101220201010212 is a wasteful number, since it uses less digits than its factorization.
101220201010212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 777068 (or 777066 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101220201010212 its reverse (212010102022101), we get a palindrome (313230303032313).
The spelling of 101220201010212 in words is "one hundred one trillion, two hundred twenty billion, two hundred one million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •