Base | Representation |
---|---|
bin | 11101000110101010011… |
… | …11011101011000110011 |
3 | 10112121012102021002122200 |
4 | 32203111033131120303 |
5 | 112341010030342321 |
6 | 2043222005034243 |
7 | 132151115566110 |
oct | 16432517353063 |
9 | 3477172232580 |
10 | 1000010012211 |
11 | 356113644251 |
12 | 1419853b5983 |
13 | 733ba392b22 |
14 | 365878d1907 |
15 | 1b02c592d26 |
hex | e8d53dd633 |
1000010012211 has 24 divisors (see below), whose sum is σ = 1659363619680. Its totient is φ = 568473486336.
The previous prime is 1000010012173. The next prime is 1000010012213. The reversal of 1000010012211 is 1122100100001.
It is a happy number.
It is not a de Polignac number, because 1000010012211 - 217 = 1000009881139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1000010012193 and 1000010012202.
It is not an unprimeable number, because it can be changed into a prime (1000010012213) 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 23 ways as a sum of consecutive naturals, for example, 41110056 + ... + 41134373.
It is an arithmetic number, because the mean of its divisors is an integer number (69140150820).
Almost surely, 21000010012211 is an apocalyptic number.
1000010012211 is a deficient number, since it is larger than the sum of its proper divisors (659353607469).
1000010012211 is a wasteful number, since it uses less digits than its factorization.
1000010012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82244635 (or 82244632 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1000010012211 its reverse (1122100100001), we get a palindrome (2122110112212).
The spelling of 1000010012211 in words is "one trillion, ten million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •