Base | Representation |
---|---|
bin | 1010100110011111111000… |
… | …10001110001000010010001 |
3 | 10001112200222110010220211211 |
4 | 11103033330101301002101 |
5 | 11023430031111443441 |
6 | 121325504211140121 |
7 | 4624211240444632 |
oct | 523177421610221 |
9 | 101480873126754 |
10 | 23313020031121 |
11 | 7478aa6047107 |
12 | 27462772a4641 |
13 | 1001540208862 |
14 | 5a84db557889 |
15 | 2a6659d45a81 |
hex | 1533fc471091 |
23313020031121 has 2 divisors, whose sum is σ = 23313020031122. Its totient is φ = 23313020031120.
The previous prime is 23313020031097. The next prime is 23313020031127. The reversal of 23313020031121 is 12113002031332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19776698410000 + 3536321621121 = 4447100^2 + 1880511^2 .
It is a cyclic number.
It is not a de Polignac number, because 23313020031121 - 211 = 23313020029073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23313020031092 and 23313020031101.
It is not a weakly prime, because it can be changed into another prime (23313020031127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11656510015560 + 11656510015561.
It is an arithmetic number, because the mean of its divisors is an integer number (11656510015561).
Almost surely, 223313020031121 is an apocalyptic number.
It is an amenable number.
23313020031121 is a deficient number, since it is larger than the sum of its proper divisors (1).
23313020031121 is an equidigital number, since it uses as much as digits as its factorization.
23313020031121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 23313020031121 its reverse (12113002031332), we get a palindrome (35426022062453).
The spelling of 23313020031121 in words is "twenty-three trillion, three hundred thirteen billion, twenty million, thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •