Base | Representation |
---|---|
bin | 1001010010111000110110… |
… | …0011111101010111000100 |
3 | 1100012000212111101001201120 |
4 | 2110232031203331113010 |
5 | 2314421232131223022 |
6 | 33423014455153540 |
7 | 2103243442306431 |
oct | 224561543752704 |
9 | 40160774331646 |
10 | 10220102211012 |
11 | 3290359295951 |
12 | 11908836758b0 |
13 | 5919a008b2c5 |
14 | 274926d00b88 |
15 | 12acad0c2d5c |
hex | 94b8d8fd5c4 |
10220102211012 has 96 divisors (see below), whose sum is σ = 25757493952512. Its totient is φ = 3145548422016.
The previous prime is 10220102211001. The next prime is 10220102211031. The reversal of 10220102211012 is 21011220102201.
It is a junction number, because it is equal to n+sod(n) for n = 10220102210982 and 10220102211000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2643208 + ... + 5237055.
It is an arithmetic number, because the mean of its divisors is an integer number (268307228672).
Almost surely, 210220102211012 is an apocalyptic number.
10220102211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10220102211012 is an abundant number, since it is smaller than the sum of its proper divisors (15537391741500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220102211012 is a wasteful number, since it uses less digits than its factorization.
10220102211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7880457 (or 7880455 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10220102211012 its reverse (21011220102201), we get a palindrome (31231322313213).
The spelling of 10220102211012 in words is "ten trillion, two hundred twenty billion, one hundred two million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •