Base | Representation |
---|---|
bin | 10010110110101010… |
… | …10000110001111001 |
3 | 222010102202211000122 |
4 | 21123111100301321 |
5 | 131212243010001 |
6 | 4352230343025 |
7 | 505560402134 |
oct | 113325206171 |
9 | 28112684018 |
10 | 10122235001 |
11 | 4324812a7a |
12 | 1b65abaa75 |
13 | c54117788 |
14 | 6c04a121b |
15 | 3e39a5b1b |
hex | 25b550c79 |
10122235001 has 2 divisors, whose sum is σ = 10122235002. Its totient is φ = 10122235000.
The previous prime is 10122234973. The next prime is 10122235031. The reversal of 10122235001 is 10053222101.
It is a happy number.
10122235001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7797066601 + 2325168400 = 88301^2 + 48220^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122235001 - 26 = 10122234937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10122235031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061117500 + 5061117501.
It is an arithmetic number, because the mean of its divisors is an integer number (5061117501).
Almost surely, 210122235001 is an apocalyptic number.
It is an amenable number.
10122235001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122235001 is an equidigital number, since it uses as much as digits as its factorization.
10122235001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 10122235001 its reverse (10053222101), we get a palindrome (20175457102).
The spelling of 10122235001 in words is "ten billion, one hundred twenty-two million, two hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •