Base | Representation |
---|---|
bin | 11101000110101010110… |
… | …11001111100000110111 |
3 | 10112121012122002000211101 |
4 | 32203111123033200313 |
5 | 112341011323213421 |
6 | 2043222155150531 |
7 | 132151154052463 |
oct | 16432533174067 |
9 | 3477178060741 |
10 | 1000013101111 |
11 | 356115363a62 |
12 | 141986445447 |
13 | 733bac04a8b |
14 | 365880974a3 |
15 | 1b02c9a3191 |
hex | e8d56cf837 |
1000013101111 has 4 divisors (see below), whose sum is σ = 1000953848272. Its totient is φ = 999072353952.
The previous prime is 1000013101103. The next prime is 1000013101117. The reversal of 1000013101111 is 1111013100001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1000013101111 - 23 = 1000013101103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000013101117) 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 3 ways as a sum of consecutive naturals, for example, 470371986 + ... + 470374111.
It is an arithmetic number, because the mean of its divisors is an integer number (250238462068).
Almost surely, 21000013101111 is an apocalyptic number.
1000013101111 is a deficient number, since it is larger than the sum of its proper divisors (940747161).
1000013101111 is an equidigital number, since it uses as much as digits as its factorization.
1000013101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940747160.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1000013101111 its reverse (1111013100001), we get a palindrome (2111026201112).
The spelling of 1000013101111 in words is "one trillion, thirteen million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •