Base | Representation |
---|---|
bin | 1001001011111101001111… |
… | …0010011010001101010101 |
3 | 1022202122111112200000202112 |
4 | 2102333103302122031111 |
5 | 2310443342424220041 |
6 | 33252202314320405 |
7 | 2061526503401222 |
oct | 222772362321525 |
9 | 38678445600675 |
10 | 10101021320021 |
11 | 3244901224a55 |
12 | 117178b729105 |
13 | 5836a342b328 |
14 | 26cc6ba8a949 |
15 | 127b3db70deb |
hex | 92fd3c9a355 |
10101021320021 has 2 divisors, whose sum is σ = 10101021320022. Its totient is φ = 10101021320020.
The previous prime is 10101021319933. The next prime is 10101021320041. The reversal of 10101021320021 is 12002312010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6722814079921 + 3378207240100 = 2592839^2 + 1837990^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101021320021 - 218 = 10101021057877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101021319978 and 10101021320005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101021320041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050510660010 + 5050510660011.
It is an arithmetic number, because the mean of its divisors is an integer number (5050510660011).
Almost surely, 210101021320021 is an apocalyptic number.
It is an amenable number.
10101021320021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101021320021 is an equidigital number, since it uses as much as digits as its factorization.
10101021320021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10101021320021 its reverse (12002312010101), we get a palindrome (22103333330122).
The spelling of 10101021320021 in words is "ten trillion, one hundred one billion, twenty-one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •