Base | Representation |
---|---|
bin | 10010110100001010… |
… | …01000100111000101 |
3 | 222001222020122121102 |
4 | 21122011020213011 |
5 | 131141403330041 |
6 | 4350200225445 |
7 | 505214016131 |
oct | 113205104705 |
9 | 28058218542 |
10 | 10101230021 |
11 | 4313976693 |
12 | 1b5aa6b285 |
13 | c4c971aac |
14 | 6bb7943c1 |
15 | 3e1c0709b |
hex | 25a1489c5 |
10101230021 has 2 divisors, whose sum is σ = 10101230022. Its totient is φ = 10101230020.
The previous prime is 10101229993. The next prime is 10101230023. The reversal of 10101230021 is 12003210101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9810902500 + 290327521 = 99050^2 + 17039^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10101230021 is a prime.
It is a super-4 number, since 4×101012300214 (a number of 41 digits) contains 4444 as substring.
Together with 10101230023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101229984 and 10101230011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101230023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050615010 + 5050615011.
It is an arithmetic number, because the mean of its divisors is an integer number (5050615011).
Almost surely, 210101230021 is an apocalyptic number.
It is an amenable number.
10101230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101230021 is an equidigital number, since it uses as much as digits as its factorization.
10101230021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10101230021 its reverse (12003210101), we get a palindrome (22104440122).
The spelling of 10101230021 in words is "ten billion, one hundred one million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •