Base | Representation |
---|---|
bin | 1001100111000001110100… |
… | …11101110111001100110011 |
3 | 2202211012221202011000112111 |
4 | 10303200322131313030303 |
5 | 10232212241310044443 |
6 | 112540001410110151 |
7 | 4310516053165405 |
oct | 463407235671463 |
9 | 82735852130474 |
10 | 21132220003123 |
11 | 6808140304289 |
12 | 245369587b357 |
13 | ba39b536a3c8 |
14 | 530b3a936b75 |
15 | 269a6e2ce69d |
hex | 13383a777333 |
21132220003123 has 16 divisors (see below), whose sum is σ = 21990435408000. Its totient is φ = 20282935099392.
The previous prime is 21132220003093. The next prime is 21132220003183. The reversal of 21132220003123 is 32130002223112.
It is a cyclic number.
It is not a de Polignac number, because 21132220003123 - 237 = 20994781049651 is a prime.
It is a super-2 number, since 2×211322200031232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21132220003094 and 21132220003103.
It is not an unprimeable number, because it can be changed into a prime (21132220003183) 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, 1357123 + ... + 6641251.
It is an arithmetic number, because the mean of its divisors is an integer number (1374402213000).
Almost surely, 221132220003123 is an apocalyptic number.
21132220003123 is a deficient number, since it is larger than the sum of its proper divisors (858215404877).
21132220003123 is a wasteful number, since it uses less digits than its factorization.
21132220003123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5284974.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21132220003123 its reverse (32130002223112), we get a palindrome (53262222226235).
The spelling of 21132220003123 in words is "twenty-one trillion, one hundred thirty-two billion, two hundred twenty million, three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •