Base | Representation |
---|---|
bin | 1001010011000100110101… |
… | …1010101101101110000001 |
3 | 1100012100011211010011010111 |
4 | 2110301031122231232001 |
5 | 2314444330134404441 |
6 | 33424310121231321 |
7 | 2103416265546226 |
oct | 224611532555601 |
9 | 40170154104114 |
10 | 10223321013121 |
11 | 3291760210587 |
12 | 1191421632541 |
13 | 592093bb0c38 |
14 | 274b505c194d |
15 | 12adea987081 |
hex | 94c4d6adb81 |
10223321013121 has 2 divisors, whose sum is σ = 10223321013122. Its totient is φ = 10223321013120.
The previous prime is 10223321013109. The next prime is 10223321013221. The reversal of 10223321013121 is 12131012332201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7830684368896 + 2392636644225 = 2798336^2 + 1546815^2 .
It is a cyclic number.
It is not a de Polignac number, because 10223321013121 - 29 = 10223321012609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10223321013092 and 10223321013101.
It is not a weakly prime, because it can be changed into another prime (10223321013221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111660506560 + 5111660506561.
It is an arithmetic number, because the mean of its divisors is an integer number (5111660506561).
Almost surely, 210223321013121 is an apocalyptic number.
It is an amenable number.
10223321013121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223321013121 is an equidigital number, since it uses as much as digits as its factorization.
10223321013121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10223321013121 its reverse (12131012332201), we get a palindrome (22354333345322).
The spelling of 10223321013121 in words is "ten trillion, two hundred twenty-three billion, three hundred twenty-one million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •