Base | Representation |
---|---|
bin | 1010011101110001010011… |
… | …01000000001110100000011 |
3 | 10000111000220211000221222112 |
4 | 11032320221220001310003 |
5 | 11004021344040143021 |
6 | 120540030514125535 |
7 | 4563433615034462 |
oct | 516705150016403 |
9 | 100430824027875 |
10 | 23013133131011 |
11 | 73728a67794a1 |
12 | 26b81238808ab |
13 | cac18a95927a |
14 | 597bad4569d9 |
15 | 29d957577d5b |
hex | 14ee29a01d03 |
23013133131011 has 2 divisors, whose sum is σ = 23013133131012. Its totient is φ = 23013133131010.
The previous prime is 23013133130989. The next prime is 23013133131059. The reversal of 23013133131011 is 11013133131032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23013133131011 - 26 = 23013133130947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (23013133131511) 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 as a sum of consecutive naturals, namely, 11506566565505 + 11506566565506.
It is an arithmetic number, because the mean of its divisors is an integer number (11506566565506).
Almost surely, 223013133131011 is an apocalyptic number.
23013133131011 is a deficient number, since it is larger than the sum of its proper divisors (1).
23013133131011 is an equidigital number, since it uses as much as digits as its factorization.
23013133131011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 23013133131011 its reverse (11013133131032), we get a palindrome (34026266262043).
The spelling of 23013133131011 in words is "twenty-three trillion, thirteen billion, one hundred thirty-three million, one hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •