Base | Representation |
---|---|
bin | 11101101111101000001… |
… | …00001111000101010100 |
3 | 10121200222002001211201210 |
4 | 32313310010033011110 |
5 | 113221030003001322 |
6 | 2101300133421420 |
7 | 133560106445154 |
oct | 16676404170524 |
9 | 3550862054653 |
10 | 1022002000212 |
11 | 364479538346 |
12 | 1460a249a870 |
13 | 754b366b08b |
14 | 37672588764 |
15 | 1b8b813c70c |
hex | edf410f154 |
1022002000212 has 24 divisors (see below), whose sum is σ = 2387547920800. Its totient is φ = 340256392416.
The previous prime is 1022002000177. The next prime is 1022002000219. The reversal of 1022002000212 is 2120002002201.
1022002000212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022002000219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51357262 + ... + 51377157.
Almost surely, 21022002000212 is an apocalyptic number.
1022002000212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022002000212 is an abundant number, since it is smaller than the sum of its proper divisors (1365545920588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022002000212 is a wasteful number, since it uses less digits than its factorization.
1022002000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102735255 (or 102735253 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1022002000212 its reverse (2120002002201), we get a palindrome (3142004002413).
The spelling of 1022002000212 in words is "one trillion, twenty-two billion, two million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •