Base | Representation |
---|---|
bin | 1001010011100101001101… |
… | …1001010001001100010101 |
3 | 1100020011121110022000100202 |
4 | 2110321103121101030111 |
5 | 2320120124333411041 |
6 | 33432304314550245 |
7 | 2104144530312335 |
oct | 224712331211425 |
9 | 40204543260322 |
10 | 10232011232021 |
11 | 329540a657677 |
12 | 1193047a38385 |
13 | 592b4a41a3b7 |
14 | 2753367d90c5 |
15 | 12b258871a9b |
hex | 94e53651315 |
10232011232021 has 2 divisors, whose sum is σ = 10232011232022. Its totient is φ = 10232011232020.
The previous prime is 10232011231991. The next prime is 10232011232039. The reversal of 10232011232021 is 12023211023201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9131849391025 + 1100161840996 = 3021895^2 + 1048886^2 .
It is a cyclic number.
It is not a de Polignac number, because 10232011232021 - 26 = 10232011231957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10232011231984 and 10232011232002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10232011232621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116005616010 + 5116005616011.
It is an arithmetic number, because the mean of its divisors is an integer number (5116005616011).
Almost surely, 210232011232021 is an apocalyptic number.
It is an amenable number.
10232011232021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10232011232021 is an equidigital number, since it uses as much as digits as its factorization.
10232011232021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10232011232021 its reverse (12023211023201), we get a palindrome (22255222255222).
The spelling of 10232011232021 in words is "ten trillion, two hundred thirty-two billion, eleven million, two hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •