Base | Representation |
---|---|
bin | 10101100010110110… |
… | …100010010100101101 |
3 | 2012201012101101211101 |
4 | 111202312202110231 |
5 | 334334111100023 |
6 | 14343254523101 |
7 | 1446156543235 |
oct | 254266422455 |
9 | 65635341741 |
10 | 23133300013 |
11 | 98a116576a |
12 | 4597366491 |
13 | 2248891a05 |
14 | 11964aacc5 |
15 | 905d911ad |
hex | 562da252d |
23133300013 has 4 divisors (see below), whose sum is σ = 23371787740. Its totient is φ = 22894812288.
The previous prime is 23133300007. The next prime is 23133300037. The reversal of 23133300013 is 31000333132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5877062244 + 17256237769 = 76662^2 + 131363^2 .
It is a cyclic number.
It is not a de Polignac number, because 23133300013 - 213 = 23133291821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23133301013) 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 3 ways as a sum of consecutive naturals, for example, 119243718 + ... + 119243911.
It is an arithmetic number, because the mean of its divisors is an integer number (5842946935).
Almost surely, 223133300013 is an apocalyptic number.
It is an amenable number.
23133300013 is a deficient number, since it is larger than the sum of its proper divisors (238487727).
23133300013 is an equidigital number, since it uses as much as digits as its factorization.
23133300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238487726.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 23133300013 its reverse (31000333132), we get a palindrome (54133633145).
The spelling of 23133300013 in words is "twenty-three billion, one hundred thirty-three million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •