Base | Representation |
---|---|
bin | 11101101111101001000… |
… | …11100011111111010111 |
3 | 10121200222122112001121121 |
4 | 32313310203203333113 |
5 | 113221034103243221 |
6 | 2101301025424411 |
7 | 133560236320144 |
oct | 16676443437727 |
9 | 3550878461547 |
10 | 1022010212311 |
11 | 364483137200 |
12 | 1460a519b107 |
13 | 754b5284bca |
14 | 376736c53cb |
15 | 1b8b8c10a41 |
hex | edf48e3fd7 |
1022010212311 has 48 divisors (see below), whose sum is σ = 1232751229920. Its totient is φ = 842723481600.
The previous prime is 1022010212263. The next prime is 1022010212317. The reversal of 1022010212311 is 1132120102201.
It is not a de Polignac number, because 1022010212311 - 27 = 1022010212183 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022010212317) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32614531 + ... + 32645851.
It is an arithmetic number, because the mean of its divisors is an integer number (25682317290).
Almost surely, 21022010212311 is an apocalyptic number.
1022010212311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1022010212311 is a deficient number, since it is larger than the sum of its proper divisors (210741017609).
1022010212311 is a wasteful number, since it uses less digits than its factorization.
1022010212311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31936 (or 31925 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1022010212311 its reverse (1132120102201), we get a palindrome (2154130314512).
It can be divided in two parts, 1022010 and 212311, that added together give a palindrome (1234321).
The spelling of 1022010212311 in words is "one trillion, twenty-two billion, ten million, two hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •