Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …10000100100000111001 |
3 | 10112121011201211010220220 |
4 | 32203110222010200321 |
5 | 112341000023223001 |
6 | 2043221015010253 |
7 | 132150636355131 |
oct | 16432452044071 |
9 | 3477151733826 |
10 | 1000000211001 |
11 | 35610905a480 |
12 | 141982069989 |
13 | 733b83408ac |
14 | 3658649dac1 |
15 | 1b02b7a8c36 |
hex | e8d4a84839 |
1000000211001 has 32 divisors (see below), whose sum is σ = 1473369937920. Its totient is φ = 598221624000.
The previous prime is 1000000210999. The next prime is 1000000211011. The reversal of 1000000211001 is 1001120000001.
It is not a de Polignac number, because 1000000211001 - 21 = 1000000210999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1000000211011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9596686 + ... + 9700328.
It is an arithmetic number, because the mean of its divisors is an integer number (46042810560).
Almost surely, 21000000211001 is an apocalyptic number.
1000000211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000000211001 is a deficient number, since it is larger than the sum of its proper divisors (473369726919).
1000000211001 is a wasteful number, since it uses less digits than its factorization.
1000000211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107437.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 1000000211001 its reverse (1001120000001), we get a palindrome (2001120211002).
The spelling of 1000000211001 in words is "one trillion, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •