Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01000111011101111010 |
3 | 10112121110110111101202121 |
4 | 32203123101013131322 |
5 | 112341211421010020 |
6 | 2043240015551454 |
7 | 132153454112635 |
oct | 16433321073572 |
9 | 3477413441677 |
10 | 1000111110010 |
11 | 356165715551 |
12 | 1419b322b58a |
13 | 734052cc1cc |
14 | 365970cac1c |
15 | 1b0363b2baa |
hex | e8db44777a |
1000111110010 has 32 divisors (see below), whose sum is σ = 1872903094272. Its totient is φ = 384091424640.
The previous prime is 1000111109999. The next prime is 1000111110013. The reversal of 1000111110010 is 100111110001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1000111109975 and 1000111110002.
It is not an unprimeable number, because it can be changed into a prime (1000111110013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12662067 + ... + 12740806.
It is an arithmetic number, because the mean of its divisors is an integer number (58528221696).
Almost surely, 21000111110010 is an apocalyptic number.
1000111110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000111110010 is a deficient number, since it is larger than the sum of its proper divisors (872791984262).
1000111110010 is a wasteful number, since it uses less digits than its factorization.
1000111110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25403038.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1000111110010 its reverse (100111110001), we get a palindrome (1100222220011).
Subtracting from 1000111110010 its reverse (100111110001), we obtain a palindrome (900000000009).
The spelling of 1000111110010 in words is "one trillion, one hundred eleven million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •