Base | Representation |
---|---|
bin | 11101000110101010101… |
… | …11011011010110010011 |
3 | 10112121012120012012221122 |
4 | 32203111113123112103 |
5 | 112341011044213021 |
6 | 2043222121512455 |
7 | 132151142415650 |
oct | 16432527332623 |
9 | 3477176165848 |
10 | 1000012101011 |
11 | 356114840630 |
12 | 14198604272b |
13 | 733ba9447c1 |
14 | 36587cb6c27 |
15 | 1b02c856bab |
hex | e8d55db593 |
1000012101011 has 32 divisors (see below), whose sum is σ = 1285902673920. Its totient is φ = 755099568000.
The previous prime is 1000012100999. The next prime is 1000012101019. The reversal of 1000012101011 is 1101012100001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1000012101011 - 210 = 1000012099987 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000012101011.
It is not an unprimeable number, because it can be changed into a prime (1000012101019) 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 31 ways as a sum of consecutive naturals, for example, 1002416 + ... + 1733453.
It is an arithmetic number, because the mean of its divisors is an integer number (40184458560).
Almost surely, 21000012101011 is an apocalyptic number.
1000012101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000012101011 is a deficient number, since it is larger than the sum of its proper divisors (285890572909).
1000012101011 is a wasteful number, since it uses less digits than its factorization.
1000012101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2736035.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1000012101011 its reverse (1101012100001), we get a palindrome (2101024201012).
The spelling of 1000012101011 in words is "one trillion, twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •