Base | Representation |
---|---|
bin | 10101101000101100… |
… | …011000011001011101 |
3 | 2012222000210101012110 |
4 | 111220230120121131 |
5 | 340034203114323 |
6 | 14401115224233 |
7 | 1451456542101 |
oct | 255054303135 |
9 | 65860711173 |
10 | 23231301213 |
11 | 994151149a |
12 | 4604148079 |
13 | 2262c857a3 |
14 | 11a54db901 |
15 | 90e79d793 |
hex | 568b1865d |
23231301213 has 16 divisors (see below), whose sum is σ = 31455733760. Its totient is φ = 15247471536.
The previous prime is 23231301211. The next prime is 23231301221. The reversal of 23231301213 is 31210313232.
It is not a de Polignac number, because 23231301213 - 21 = 23231301211 is a prime.
It is a super-3 number, since 3×232313012133 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23231301213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23231301211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320706 + ... + 386412.
It is an arithmetic number, because the mean of its divisors is an integer number (1965983360).
Almost surely, 223231301213 is an apocalyptic number.
It is an amenable number.
23231301213 is a deficient number, since it is larger than the sum of its proper divisors (8224432547).
23231301213 is a wasteful number, since it uses less digits than its factorization.
23231301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67536.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23231301213 its reverse (31210313232), we get a palindrome (54441614445).
The spelling of 23231301213 in words is "twenty-three billion, two hundred thirty-one million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •