Base | Representation |
---|---|
bin | 11101011101011000110… |
… | …11100001110010101011 |
3 | 10120202200200002110111112 |
4 | 32232230123201302223 |
5 | 113041001303241021 |
6 | 2053000345420535 |
7 | 133062340561535 |
oct | 16565433416253 |
9 | 3522620073445 |
10 | 1012210212011 |
11 | 3603043049a9 |
12 | 14420b19a74b |
13 | 745b2b5186b |
14 | 36dc3d44855 |
15 | 1b4e36abd5b |
hex | ebac6e1cab |
1012210212011 has 8 divisors (see below), whose sum is σ = 1033758204624. Its totient is φ = 990752948640.
The previous prime is 1012210211981. The next prime is 1012210212029. The reversal of 1012210212011 is 1102120122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1012210212011 - 210 = 1012210210987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012210212031) 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, 22659761 + ... + 22704386.
It is an arithmetic number, because the mean of its divisors is an integer number (129219775578).
Almost surely, 21012210212011 is an apocalyptic number.
1012210212011 is a deficient number, since it is larger than the sum of its proper divisors (21547992613).
1012210212011 is an equidigital number, since it uses as much as digits as its factorization.
1012210212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45364621.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1012210212011 its reverse (1102120122101), we get a palindrome (2114330334112).
It can be divided in two parts, 1012210 and 212011, that added together give a palindrome (1224221).
The spelling of 1012210212011 in words is "one trillion, twelve billion, two hundred ten million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •