Base | Representation |
---|---|
bin | 1010100000010011011111… |
… | …11111011111100011111101 |
3 | 10000210100200120020022222120 |
4 | 11100021233333133203331 |
5 | 11011433214014030323 |
6 | 121044031422433153 |
7 | 4602635546013411 |
oct | 520115777374375 |
9 | 100710616208876 |
10 | 23100213033213 |
11 | 73a6822043918 |
12 | 2710b867327b9 |
13 | cb74577c1a14 |
14 | 59c0b05cad41 |
15 | 2a0d523955e3 |
hex | 15026ffdf8fd |
23100213033213 has 16 divisors (see below), whose sum is σ = 30888207642240. Its totient is φ = 15356186138304.
The previous prime is 23100213033203. The next prime is 23100213033257. The reversal of 23100213033213 is 31233031200132.
It is not a de Polignac number, because 23100213033213 - 217 = 23100212902141 is a prime.
It is a super-2 number, since 2×231002130332132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23100213033203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15049395 + ... + 16513167.
It is an arithmetic number, because the mean of its divisors is an integer number (1930512977640).
Almost surely, 223100213033213 is an apocalyptic number.
It is an amenable number.
23100213033213 is a deficient number, since it is larger than the sum of its proper divisors (7787994609027).
23100213033213 is a wasteful number, since it uses less digits than its factorization.
23100213033213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1478788.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 23100213033213 its reverse (31233031200132), we get a palindrome (54333244233345).
The spelling of 23100213033213 in words is "twenty-three trillion, one hundred billion, two hundred thirteen million, thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •