Base | Representation |
---|---|
bin | 10001100110111010111… |
… | …000010000111111011011 |
3 | 11021200021110012212001112 |
4 | 101212322320100333123 |
5 | 124311110401401021 |
6 | 2323513120010535 |
7 | 153264310556132 |
oct | 21467270207733 |
9 | 4250243185045 |
10 | 1210021122011 |
11 | 427192418409 |
12 | 176615760a4b |
13 | 8a14878c1c0 |
14 | 427cb3c8919 |
15 | 2171e86bd5b |
hex | 119bae10fdb |
1210021122011 has 8 divisors (see below), whose sum is σ = 1303108217040. Its totient is φ = 1116935248032.
The previous prime is 1210021121957. The next prime is 1210021122017. The reversal of 1210021122011 is 1102211200121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1210021122011 is a prime.
It is a super-2 number, since 2×12100211220112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210021122017) 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 7 ways as a sum of consecutive naturals, for example, 3678905 + ... + 3994293.
It is an arithmetic number, because the mean of its divisors is an integer number (162888527130).
Almost surely, 21210021122011 is an apocalyptic number.
1210021122011 is a deficient number, since it is larger than the sum of its proper divisors (93087095029).
1210021122011 is a wasteful number, since it uses less digits than its factorization.
1210021122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610525.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1210021122011 its reverse (1102211200121), we get a palindrome (2312232322132).
The spelling of 1210021122011 in words is "one trillion, two hundred ten billion, twenty-one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •