Base | Representation |
---|---|
bin | 1010100011010011001101… |
… | …00001001100110000001011 |
3 | 10001011012100020220012122021 |
4 | 11101221212201030300023 |
5 | 11020130004111441021 |
6 | 121203212225305311 |
7 | 4613241162652312 |
oct | 521514641146013 |
9 | 101135306805567 |
10 | 23203133312011 |
11 | 7436436939674 |
12 | 2728b0a495237 |
13 | cc407a322483 |
14 | 5a3075421279 |
15 | 2a3877b77c41 |
hex | 151a6684cc0b |
23203133312011 has 4 divisors (see below), whose sum is σ = 23416006094800. Its totient is φ = 22990260529224.
The previous prime is 23203133311997. The next prime is 23203133312039. The reversal of 23203133312011 is 11021333130232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23203133312011 - 215 = 23203133279243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23203133322011) 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 3 ways as a sum of consecutive naturals, for example, 106436391231 + ... + 106436391448.
It is an arithmetic number, because the mean of its divisors is an integer number (5854001523700).
Almost surely, 223203133312011 is an apocalyptic number.
23203133312011 is a deficient number, since it is larger than the sum of its proper divisors (212872782789).
23203133312011 is a wasteful number, since it uses less digits than its factorization.
23203133312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212872782788.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 23203133312011 its reverse (11021333130232), we get a palindrome (34224466442243).
The spelling of 23203133312011 in words is "twenty-three trillion, two hundred three billion, one hundred thirty-three million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •