Base | Representation |
---|---|
bin | 10001110010001010111… |
… | …101001010100101011100 |
3 | 11022211110101112010220120 |
4 | 101302022331022211130 |
5 | 130010331103031022 |
6 | 2333231555114540 |
7 | 154202553422463 |
oct | 21621275124534 |
9 | 4284411463816 |
10 | 1222102002012 |
11 | 4313217a1361 |
12 | 178a275a2a50 |
13 | 8b3226017c8 |
14 | 43215a5b9da |
15 | 21bca266d5c |
hex | 11c8af4a95c |
1222102002012 has 12 divisors (see below), whose sum is σ = 2851571338056. Its totient is φ = 407367334000.
The previous prime is 1222102002001. The next prime is 1222102002047. The reversal of 1222102002012 is 2102002012221.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 1222102001982 and 1222102002000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50920916739 + ... + 50920916762.
It is an arithmetic number, because the mean of its divisors is an integer number (237630944838).
Almost surely, 21222102002012 is an apocalyptic number.
1222102002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1222102002012 is an abundant number, since it is smaller than the sum of its proper divisors (1629469336044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222102002012 is a wasteful number, since it uses less digits than its factorization.
1222102002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101841833508 (or 101841833506 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1222102002012 its reverse (2102002012221), we get a palindrome (3324104014233).
The spelling of 1222102002012 in words is "one trillion, two hundred twenty-two billion, one hundred two million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •