Base | Representation |
---|---|
bin | 1010011101110001000101… |
… | …00010011010110101000101 |
3 | 10000111000121112021122212202 |
4 | 11032320202202122311011 |
5 | 11004021123120020401 |
6 | 120540011025324245 |
7 | 4563430642230443 |
oct | 516704242326505 |
9 | 100430545248782 |
10 | 23013014220101 |
11 | 7372845640a14 |
12 | 26b80aba96685 |
13 | cac16c123c99 |
14 | 597b9b741b93 |
15 | 29d94bdda06b |
hex | 14ee2289ad45 |
23013014220101 has 2 divisors, whose sum is σ = 23013014220102. Its totient is φ = 23013014220100.
The previous prime is 23013014220083. The next prime is 23013014220103. The reversal of 23013014220101 is 10102241031032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20667261607876 + 2345752612225 = 4546126^2 + 1531585^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23013014220101 is a prime.
Together with 23013014220103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23013014220103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11506507110050 + 11506507110051.
It is an arithmetic number, because the mean of its divisors is an integer number (11506507110051).
Almost surely, 223013014220101 is an apocalyptic number.
It is an amenable number.
23013014220101 is a deficient number, since it is larger than the sum of its proper divisors (1).
23013014220101 is an equidigital number, since it uses as much as digits as its factorization.
23013014220101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 23013014220101 its reverse (10102241031032), we get a palindrome (33115255251133).
The spelling of 23013014220101 in words is "twenty-three trillion, thirteen billion, fourteen million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •