Base | Representation |
---|---|
bin | 11101011101000001000… |
… | …11101011011010111010 |
3 | 10120202011210021120012002 |
4 | 32232200203223122322 |
5 | 113040044310201020 |
6 | 2052524512221002 |
7 | 133054401516632 |
oct | 16564043533272 |
9 | 3522153246162 |
10 | 1012011022010 |
11 | 36021192556a |
12 | 14417453a762 |
13 | 745807bc161 |
14 | 36da56d36c2 |
15 | 1b4d0e62975 |
hex | eba08eb6ba |
1012011022010 has 32 divisors (see below), whose sum is σ = 1824729690240. Its totient is φ = 404113553728.
The previous prime is 1012011022007. The next prime is 1012011022013. The reversal of 1012011022010 is 102201102101.
It is an interprime number because it is at equal distance from previous prime (1012011022007) and next prime (1012011022013).
It is a junction number, because it is equal to n+sod(n) for n = 1012011021982 and 1012011022000.
It is not an unprimeable number, because it can be changed into a prime (1012011022013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53033651 + ... + 53052729.
It is an arithmetic number, because the mean of its divisors is an integer number (57022802820).
Almost surely, 21012011022010 is an apocalyptic number.
1012011022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012011022010 is a deficient number, since it is larger than the sum of its proper divisors (812718668230).
1012011022010 is a wasteful number, since it uses less digits than its factorization.
1012011022010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27862.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1012011022010 its reverse (102201102101), we get a palindrome (1114212124111).
It can be divided in two parts, 101201 and 1022010, that added together give a palindrome (1123211).
The spelling of 1012011022010 in words is "one trillion, twelve billion, eleven million, twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •