Base | Representation |
---|---|
bin | 11101000110110111111… |
… | …10110111001100111011 |
3 | 10112121111022001122200210 |
4 | 32203123332313030323 |
5 | 112341223003231021 |
6 | 2043241125002203 |
7 | 132153661050015 |
oct | 16433376671473 |
9 | 3477438048623 |
10 | 1000123102011 |
11 | 3561714662a0 |
12 | 1419b7253363 |
13 | 7340793a677 |
14 | 3659892d1b5 |
15 | 1b037480e76 |
hex | e8dbfb733b |
1000123102011 has 16 divisors (see below), whose sum is σ = 1454741262720. Its totient is φ = 606128233920.
The previous prime is 1000123102009. The next prime is 1000123102021. The reversal of 1000123102011 is 1102013210001.
It is not a de Polignac number, because 1000123102011 - 21 = 1000123102009 is a prime.
It is a super-2 number, since 2×10001231020112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1000123102021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5276400 + ... + 5462658.
It is an arithmetic number, because the mean of its divisors is an integer number (90921328920).
Almost surely, 21000123102011 is an apocalyptic number.
1000123102011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000123102011 is a deficient number, since it is larger than the sum of its proper divisors (454618160709).
1000123102011 is a wasteful number, since it uses less digits than its factorization.
1000123102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348986.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1000123102011 its reverse (1102013210001), we get a palindrome (2102136312012).
It can be divided in two parts, 100012 and 3102011, that added together give a palindrome (3202023).
The spelling of 1000123102011 in words is "one trillion, one hundred twenty-three million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •