Base | Representation |
---|---|
bin | 1001100011100000011011… |
… | …11001100101110101011111 |
3 | 2202101122121120112011122211 |
4 | 10301300031321211311133 |
5 | 10223221431040304043 |
6 | 112404230150421251 |
7 | 4266003310352035 |
oct | 461601571456537 |
9 | 82348546464584 |
10 | 21011213213023 |
11 | 6770895108930 |
12 | 2434144961827 |
13 | b9546c709367 |
14 | 528d3b9d6555 |
15 | 26683ac55a9d |
hex | 131c0de65d5f |
21011213213023 has 16 divisors (see below), whose sum is σ = 23544346383360. Its totient is φ = 18582071911200.
The previous prime is 21011213213009. The next prime is 21011213213063. The reversal of 21011213213023 is 32031231211012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21011213213023 is a prime.
It is a super-2 number, since 2×210112132130232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21011213212985 and 21011213213003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011213213063) 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, 1146343 + ... + 6583048.
It is an arithmetic number, because the mean of its divisors is an integer number (1471521648960).
Almost surely, 221011213213023 is an apocalyptic number.
21011213213023 is a deficient number, since it is larger than the sum of its proper divisors (2533133170337).
21011213213023 is a wasteful number, since it uses less digits than its factorization.
21011213213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7736118.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21011213213023 its reverse (32031231211012), we get a palindrome (53042444424035).
The spelling of 21011213213023 in words is "twenty-one trillion, eleven billion, two hundred thirteen million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •