Base | Representation |
---|---|
bin | 1001101100100101011010… |
… | …01000010101100011000001 |
3 | 2210111110201001111120001220 |
4 | 10312102231020111203001 |
5 | 10243324223302113441 |
6 | 113203412424545253 |
7 | 4330354564020024 |
oct | 466225510254301 |
9 | 83443631446056 |
10 | 21323122301121 |
11 | 68810a37122a3 |
12 | 2484692622229 |
13 | bb89b98bb754 |
14 | 53a08a64d1bb |
15 | 26e9e3bc8466 |
hex | 1364ad2158c1 |
21323122301121 has 32 divisors (see below), whose sum is σ = 30406141651200. Its totient is φ = 13265836819200.
The previous prime is 21323122301113. The next prime is 21323122301171. The reversal of 21323122301121 is 12110322132312.
It is not a de Polignac number, because 21323122301121 - 23 = 21323122301113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21323122301091 and 21323122301100.
It is not an unprimeable number, because it can be changed into a prime (21323122301171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21448186 + ... + 22420323.
It is an arithmetic number, because the mean of its divisors is an integer number (950191926600).
Almost surely, 221323122301121 is an apocalyptic number.
It is an amenable number.
21323122301121 is a deficient number, since it is larger than the sum of its proper divisors (9083019350079).
21323122301121 is a wasteful number, since it uses less digits than its factorization.
21323122301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43868729.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 21323122301121 its reverse (12110322132312), we get a palindrome (33433444433433).
The spelling of 21323122301121 in words is "twenty-one trillion, three hundred twenty-three billion, one hundred twenty-two million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •