Base | Representation |
---|---|
bin | 1010100000100111111111… |
… | …01001110011011100110001 |
3 | 10000211102002011222202122202 |
4 | 11100103333221303130301 |
5 | 11012123231034414301 |
6 | 121053051134312545 |
7 | 4603505256626126 |
oct | 520237751633461 |
9 | 100742064882582 |
10 | 23111213201201 |
11 | 7400457386944 |
12 | 2713136658755 |
13 | cb84bb777968 |
14 | 59c83550274d |
15 | 2a1297e6966b |
hex | 1504ffa73731 |
23111213201201 has 2 divisors, whose sum is σ = 23111213201202. Its totient is φ = 23111213201200.
The previous prime is 23111213201191. The next prime is 23111213201207. The reversal of 23111213201201 is 10210231211132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17817642999025 + 5293570202176 = 4221095^2 + 2300776^2 .
It is a cyclic number.
It is not a de Polignac number, because 23111213201201 - 214 = 23111213184817 is a prime.
It is a super-3 number, since 3×231112132012013 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (23111213201207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11555606600600 + 11555606600601.
It is an arithmetic number, because the mean of its divisors is an integer number (11555606600601).
Almost surely, 223111213201201 is an apocalyptic number.
It is an amenable number.
23111213201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
23111213201201 is an equidigital number, since it uses as much as digits as its factorization.
23111213201201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 23111213201201 its reverse (10210231211132), we get a palindrome (33321444412333).
The spelling of 23111213201201 in words is "twenty-three trillion, one hundred eleven billion, two hundred thirteen million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •