Base | Representation |
---|---|
bin | 10010101010101101… |
… | …11100000001111001 |
3 | 221212110011220112122 |
4 | 21111112330001321 |
5 | 131011113323001 |
6 | 4334250251025 |
7 | 503232454652 |
oct | 112526740171 |
9 | 27773156478 |
10 | 10022011001 |
11 | 4283189222 |
12 | 1b38426a75 |
13 | c39426032 |
14 | 6b1052529 |
15 | 3d9ca9b1b |
hex | 2555bc079 |
10022011001 has 2 divisors, whose sum is σ = 10022011002. Its totient is φ = 10022011000.
The previous prime is 10022010979. The next prime is 10022011039. The reversal of 10022011001 is 10011022001.
10022011001 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., 9940289401 + 81721600 = 99701^2 + 9040^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022011001 - 218 = 10021748857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10022011001.
It is not a weakly prime, because it can be changed into another prime (10022011201) 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, 5011005500 + 5011005501.
It is an arithmetic number, because the mean of its divisors is an integer number (5011005501).
Almost surely, 210022011001 is an apocalyptic number.
It is an amenable number.
10022011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022011001 is an equidigital number, since it uses as much as digits as its factorization.
10022011001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10022011001 its reverse (10011022001), we get a palindrome (20033033002).
The spelling of 10022011001 in words is "ten billion, twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •