Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1010011000100000010101 |
3 | 1022202112212100212121002212 |
4 | 2102332112322120200111 |
5 | 2310434300000000041 |
6 | 33251513112043205 |
7 | 2061462262333001 |
oct | 222762672304025 |
9 | 38675770777085 |
10 | 10100000000021 |
11 | 324442776a138 |
12 | 1171545693505 |
13 | 58356c967c79 |
14 | 26cbb218d701 |
15 | 127ace17c8eb |
hex | 92f96e98815 |
10100000000021 has 2 divisors, whose sum is σ = 10100000000022. Its totient is φ = 10100000000020.
The previous prime is 10099999999997. The next prime is 10100000000039. The reversal of 10100000000021 is 12000000000101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7004121040900 + 3095878959121 = 2646530^2 + 1759511^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100000000021 - 234 = 10082820130837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10099999999933 and 10100000000014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100000000621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050000000010 + 5050000000011.
It is an arithmetic number, because the mean of its divisors is an integer number (5050000000011).
Almost surely, 210100000000021 is an apocalyptic number.
It is an amenable number.
10100000000021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100000000021 is an equidigital number, since it uses as much as digits as its factorization.
10100000000021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 10100000000021 its reverse (12000000000101), we get a palindrome (22100000000122).
The spelling of 10100000000021 in words is "ten trillion, one hundred billion, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •