Base | Representation |
---|---|
bin | 101101111101001111110111… |
… | …001000100111000111110100 |
3 | 222111122120122212022020011010 |
4 | 231331033313020213013310 |
5 | 202443022313111242322 |
6 | 1553513040002112220 |
7 | 60400522050541152 |
oct | 5575176710470764 |
9 | 874576585266133 |
10 | 202121012212212 |
11 | 59447049123275 |
12 | 1a8044a604b670 |
13 | 88a1c11632242 |
14 | 37ca9d00263d2 |
15 | 1857970d1720c |
hex | b7d3f72271f4 |
202121012212212 has 48 divisors (see below), whose sum is σ = 480520818348480. Its totient is φ = 66101545805568.
The previous prime is 202121012212157. The next prime is 202121012212219. The reversal of 202121012212212 is 212212210121202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202121012212219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44093464 + ... + 48461072.
It is an arithmetic number, because the mean of its divisors is an integer number (10010850382260).
Almost surely, 2202121012212212 is an apocalyptic number.
It is an amenable number.
202121012212212 is an abundant number, since it is smaller than the sum of its proper divisors (278399806136268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202121012212212 is a wasteful number, since it uses less digits than its factorization.
202121012212212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4440432 (or 4440430 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 202121012212212 its reverse (212212210121202), we get a palindrome (414333222333414).
The spelling of 202121012212212 in words is "two hundred two trillion, one hundred twenty-one billion, twelve million, two hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •