Base | Representation |
---|---|
bin | 10001100111000000110… |
… | …001110110000001111011 |
3 | 11021200112100110120002110 |
4 | 101213000301312001323 |
5 | 124311311221231021 |
6 | 2323531013303403 |
7 | 153266622102432 |
oct | 21470061660173 |
9 | 4250470416073 |
10 | 1210120102011 |
11 | 427233282567 |
12 | 176642934b63 |
13 | 8a163136652 |
14 | 427da5d2119 |
15 | 217283be476 |
hex | 119c0c7607b |
1210120102011 has 16 divisors (see below), whose sum is σ = 1692358884864. Its totient is φ = 768241855584.
The previous prime is 1210120101997. The next prime is 1210120102039. The reversal of 1210120102011 is 1102010210121.
It is not a de Polignac number, because 1210120102011 - 221 = 1210118004859 is a prime.
It is a super-2 number, since 2×12101201020112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1210120102111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115973325 + ... + 115983758.
It is an arithmetic number, because the mean of its divisors is an integer number (105772430304).
Almost surely, 21210120102011 is an apocalyptic number.
1210120102011 is a deficient number, since it is larger than the sum of its proper divisors (482238782853).
1210120102011 is a wasteful number, since it uses less digits than its factorization.
1210120102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231957170.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1210120102011 its reverse (1102010210121), we get a palindrome (2312130312132).
It can be divided in two parts, 1210120 and 102011, that added together give a palindrome (1312131).
The spelling of 1210120102011 in words is "one trillion, two hundred ten billion, one hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •