Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10111011001101001 |
3 | 222002122212011111000 |
4 | 21122222313121221 |
5 | 131201421333001 |
6 | 4351152225213 |
7 | 505364052612 |
oct | 113252673151 |
9 | 28078764430 |
10 | 10111121001 |
11 | 4319511953 |
12 | 1b6223b209 |
13 | c51a25b47 |
14 | 6bcc0ac09 |
15 | 3e2a0ca86 |
hex | 25aab7669 |
10111121001 has 16 divisors (see below), whose sum is σ = 15036405120. Its totient is φ = 6715112400.
The previous prime is 10111120993. The next prime is 10111121003. The reversal of 10111121001 is 10012111101.
It is not a de Polignac number, because 10111121001 - 23 = 10111120993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10111121003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 704850 + ... + 719051.
It is an arithmetic number, because the mean of its divisors is an integer number (939775320).
Almost surely, 210111121001 is an apocalyptic number.
It is an amenable number.
10111121001 is a deficient number, since it is larger than the sum of its proper divisors (4925284119).
10111121001 is a wasteful number, since it uses less digits than its factorization.
10111121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1424173 (or 1424167 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10111121001 its reverse (10012111101), we get a palindrome (20123232102).
The spelling of 10111121001 in words is "ten billion, one hundred eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •