Base | Representation |
---|---|
bin | 1001101001101001000110… |
… | …01001001100101011010001 |
3 | 2210010210202021101010011022 |
4 | 10310310203021030223101 |
5 | 10240200200343221223 |
6 | 113045132432325225 |
7 | 4320145341233660 |
oct | 464644311145321 |
9 | 83123667333138 |
10 | 21222023023313 |
11 | 6842233815542 |
12 | 2468b786a3815 |
13 | bac2c7421c88 |
14 | 5352195dadd7 |
15 | 26c0781ebac8 |
hex | 134d2324cad1 |
21222023023313 has 12 divisors (see below), whose sum is σ = 25764354201792. Its totient is φ = 17120287479360.
The previous prime is 21222023023241. The next prime is 21222023023339. The reversal of 21222023023313 is 31332032022212.
It is not a de Polignac number, because 21222023023313 - 214 = 21222023006929 is a prime.
It is a super-2 number, since 2×212220230233132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21222023022313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5245184093 + ... + 5245188138.
It is an arithmetic number, because the mean of its divisors is an integer number (2147029516816).
Almost surely, 221222023023313 is an apocalyptic number.
It is an amenable number.
21222023023313 is a deficient number, since it is larger than the sum of its proper divisors (4542331178479).
21222023023313 is a wasteful number, since it uses less digits than its factorization.
21222023023313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10490372272 (or 10490372255 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 21222023023313 its reverse (31332032022212), we get a palindrome (52554055045525).
The spelling of 21222023023313 in words is "twenty-one trillion, two hundred twenty-two billion, twenty-three million, twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •