Base | Representation |
---|---|
bin | 10010110101001110… |
… | …11110010111000001 |
3 | 222002121012000000002 |
4 | 21122213132113001 |
5 | 131201204411001 |
6 | 4351121205345 |
7 | 505353361022 |
oct | 113247362701 |
9 | 28077160002 |
10 | 10110232001 |
11 | 4318a64a41 |
12 | 1b61a90855 |
13 | c517a42cc |
14 | 6bca58c49 |
15 | 3e28d446b |
hex | 25a9de5c1 |
10110232001 has 2 divisors, whose sum is σ = 10110232002. Its totient is φ = 10110232000.
The previous prime is 10110231979. The next prime is 10110232019. The reversal of 10110232001 is 10023201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5173061776 + 4937170225 = 71924^2 + 70265^2 .
It is an emirp because it is prime and its reverse (10023201101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110232001 is a prime.
It is a super-2 number, since 2×101102320012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10110232031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055116000 + 5055116001.
It is an arithmetic number, because the mean of its divisors is an integer number (5055116001).
Almost surely, 210110232001 is an apocalyptic number.
It is an amenable number.
10110232001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110232001 is an equidigital number, since it uses as much as digits as its factorization.
10110232001 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 10110232001 its reverse (10023201101), we get a palindrome (20133433102).
It can be divided in two parts, 10 and 110232001, that added together give a palindrome (110232011).
The spelling of 10110232001 in words is "ten billion, one hundred ten million, two hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •