Base | Representation |
---|---|
bin | 10001011101101011100… |
… | …010001110100011100011 |
3 | 11020201200000220011012100 |
4 | 101131223202032203203 |
5 | 124130301100311321 |
6 | 2315152432101443 |
7 | 152463411530004 |
oct | 21355342164343 |
9 | 4221600804170 |
10 | 1200100010211 |
11 | 422a61195263 |
12 | 174707094883 |
13 | 8922723304b |
14 | 4212991d1ab |
15 | 2133d893326 |
hex | 1176b88e8e3 |
1200100010211 has 6 divisors (see below), whose sum is σ = 1733477792540. Its totient is φ = 800066673468.
The previous prime is 1200100010173. The next prime is 1200100010231. The reversal of 1200100010211 is 1120100010021.
It is a happy number.
It is not a de Polignac number, because 1200100010211 - 227 = 1199965792483 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 133344445579 = 1200100010211 / (1 + 2 + 0 + 0 + 1 + 0 + 0 + 0 + 1 + 0 + 2 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200100010193 and 1200100010202.
It is not an unprimeable number, because it can be changed into a prime (1200100010231) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 66672222781 + ... + 66672222798.
Almost surely, 21200100010211 is an apocalyptic number.
1200100010211 is a deficient number, since it is larger than the sum of its proper divisors (533377782329).
1200100010211 is a wasteful number, since it uses less digits than its factorization.
1200100010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133344445585 (or 133344445582 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1200100010211 its reverse (1120100010021), we get a palindrome (2320200020232).
The spelling of 1200100010211 in words is "one trillion, two hundred billion, one hundred million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •