Base | Representation |
---|---|
bin | 10101100010101011… |
… | …001110000000110001 |
3 | 2012200222210200011122 |
4 | 111202223032000301 |
5 | 334332331130413 |
6 | 14343111152025 |
7 | 1446122405600 |
oct | 254253160061 |
9 | 65628720148 |
10 | 23130333233 |
11 | 989a519787 |
12 | 4596375615 |
13 | 2248093517 |
14 | 1195d37a37 |
15 | 9059a7108 |
hex | 562ace031 |
23130333233 has 12 divisors (see below), whose sum is σ = 26912496420. Its totient is φ = 19821739392.
The previous prime is 23130333209. The next prime is 23130333257. The reversal of 23130333233 is 33233303132.
It is an interprime number because it is at equal distance from previous prime (23130333209) and next prime (23130333257).
It can be written as a sum of positive squares in 2 ways, for example, as 18841131169 + 4289202064 = 137263^2 + 65492^2 .
It is not a de Polignac number, because 23130333233 - 26 = 23130333169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23130333283) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 191285 + ... + 287837.
It is an arithmetic number, because the mean of its divisors is an integer number (2242708035).
Almost surely, 223130333233 is an apocalyptic number.
It is an amenable number.
23130333233 is a deficient number, since it is larger than the sum of its proper divisors (3782163187).
23130333233 is an equidigital number, since it uses as much as digits as its factorization.
23130333233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101456 (or 101449 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 26.
Adding to 23130333233 its reverse (33233303132), we get a palindrome (56363636365).
The spelling of 23130333233 in words is "twenty-three billion, one hundred thirty million, three hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •