Base | Representation |
---|---|
bin | 11101011101001110010… |
… | …11110101001110010101 |
3 | 10120202110112111120010000 |
4 | 32232213023311032111 |
5 | 113040311241224341 |
6 | 2052543523321513 |
7 | 133060221563502 |
oct | 16564713651625 |
9 | 3522415446100 |
10 | 1012122211221 |
11 | 360269669680 |
12 | 1441a5820299 |
13 | 7459a84c8a4 |
14 | 36db63984a9 |
15 | 1b4daac78b6 |
hex | eba72f5395 |
1012122211221 has 20 divisors (see below), whose sum is σ = 1649384345664. Its totient is φ = 613407400200.
The previous prime is 1012122211211. The next prime is 1012122211267. The reversal of 1012122211221 is 1221122212101.
1012122211221 is a `hidden beast` number, since 10 + 1 + 212 + 221 + 1 + 221 = 666.
It is not a de Polignac number, because 1012122211221 - 223 = 1012113822613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012122211194 and 1012122211203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012122211211) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 567968925 + ... + 567970706.
Almost surely, 21012122211221 is an apocalyptic number.
1012122211221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012122211221 is a deficient number, since it is larger than the sum of its proper divisors (637262134443).
1012122211221 is a wasteful number, since it uses less digits than its factorization.
1012122211221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1135939654 (or 1135939645 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1012122211221 its reverse (1221122212101), we get a palindrome (2233244423322).
The spelling of 1012122211221 in words is "one trillion, twelve billion, one hundred twenty-two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •