Base | Representation |
---|---|
bin | 10001101000111000000… |
… | …011011011110101100110 |
3 | 11021212200210212222020200 |
4 | 101220320003123311212 |
5 | 124324411011431042 |
6 | 2324501340011330 |
7 | 153400331135313 |
oct | 21507003336546 |
9 | 4255623788220 |
10 | 1212121202022 |
11 | 42806a900625 |
12 | 176b00b30b46 |
13 | 8a3c18a75b3 |
14 | 4294a295d0a |
15 | 217e3decc4c |
hex | 11a380dbd66 |
1212121202022 has 24 divisors (see below), whose sum is σ = 2764486952760. Its totient is φ = 382775116320.
The previous prime is 1212121201987. The next prime is 1212121202029. The reversal of 1212121202022 is 2202021212121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1212121201986 and 1212121202004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212121202029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1772106679 + ... + 1772107362.
It is an arithmetic number, because the mean of its divisors is an integer number (115186956365).
Almost surely, 21212121202022 is an apocalyptic number.
1212121202022 is an abundant number, since it is smaller than the sum of its proper divisors (1552365750738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212121202022 is a wasteful number, since it uses less digits than its factorization.
1212121202022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3544214068 (or 3544214065 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1212121202022 its reverse (2202021212121), we get a palindrome (3414142414143).
The spelling of 1212121202022 in words is "one trillion, two hundred twelve billion, one hundred twenty-one million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •