Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01100000010010101011 |
3 | 10112121011210111212210000 |
4 | 32203110231200102223 |
5 | 112341000241024321 |
6 | 2043221050154043 |
7 | 132150650124504 |
oct | 16432455402253 |
9 | 3477153455700 |
10 | 1000001111211 |
11 | 356109614853 |
12 | 141982422923 |
13 | 733b859756b |
14 | 36586655bab |
15 | 1b02b8d5826 |
hex | e8d4b604ab |
1000001111211 has 20 divisors (see below), whose sum is σ = 1493992324000. Its totient is φ = 666594439056.
The previous prime is 1000001111159. The next prime is 1000001111233. The reversal of 1000001111211 is 1121111000001.
It is not a de Polignac number, because 1000001111211 - 215 = 1000001078443 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000001111193 and 1000001111202.
It is not an unprimeable number, because it can be changed into a prime (1000001113211) 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 19 ways as a sum of consecutive naturals, for example, 74085 + ... + 1416153.
It is an arithmetic number, because the mean of its divisors is an integer number (74699616200).
Almost surely, 21000001111211 is an apocalyptic number.
1000001111211 is a deficient number, since it is larger than the sum of its proper divisors (493991212789).
1000001111211 is an equidigital number, since it uses as much as digits as its factorization.
1000001111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351280 (or 1351271 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1000001111211 its reverse (1121111000001), we get a palindrome (2121112111212).
The spelling of 1000001111211 in words is "one trillion, one million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •