Base | Representation |
---|---|
bin | 10010110100001000… |
… | …11000010010100101 |
3 | 222001221212121010001 |
4 | 21122010120102211 |
5 | 131141331011401 |
6 | 4350152101301 |
7 | 505212233116 |
oct | 113204302245 |
9 | 28057777101 |
10 | 10101032101 |
11 | 4313850a16 |
12 | 1b5a994831 |
13 | c4c902994 |
14 | 6bb74220d |
15 | 3e1bb8601 |
hex | 25a1184a5 |
10101032101 has 2 divisors, whose sum is σ = 10101032102. Its totient is φ = 10101032100.
The previous prime is 10101032087. The next prime is 10101032131. The reversal of 10101032101 is 10123010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9292767201 + 808264900 = 96399^2 + 28430^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101032101 - 217 = 10100901029 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101032131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050516050 + 5050516051.
It is an arithmetic number, because the mean of its divisors is an integer number (5050516051).
Almost surely, 210101032101 is an apocalyptic number.
It is an amenable number.
10101032101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101032101 is an equidigital number, since it uses as much as digits as its factorization.
10101032101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10101032101 its reverse (10123010101), we get a palindrome (20224042202).
The spelling of 10101032101 in words is "ten billion, one hundred one million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •