Base | Representation |
---|---|
bin | 101101111110011010010111… |
… | …010111111111110001001100 |
3 | 222111221020011001021110221120 |
4 | 231332122113113333301030 |
5 | 203000330132030324322 |
6 | 1554013510040400540 |
7 | 60406353344604642 |
oct | 5576322727776114 |
9 | 874836131243846 |
10 | 202201010011212 |
11 | 59477a6a866743 |
12 | 1a817ab1176150 |
13 | 88a9620176294 |
14 | 37d081c78b192 |
15 | 1859aa3eeda5c |
hex | b7e6975ffc4c |
202201010011212 has 24 divisors (see below), whose sum is σ = 472524871805616. Its totient is φ = 67297120225728.
The previous prime is 202201010011207. The next prime is 202201010011223. The reversal of 202201010011212 is 212110010102202.
It is a junction number, because it is equal to n+sod(n) for n = 202201010011191 and 202201010011200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12902047423 + ... + 12902063094.
It is an arithmetic number, because the mean of its divisors is an integer number (19688536325234).
Almost surely, 2202201010011212 is an apocalyptic number.
It is an amenable number.
202201010011212 is an abundant number, since it is smaller than the sum of its proper divisors (270323861794404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202201010011212 is a wasteful number, since it uses less digits than its factorization.
202201010011212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25804111177 (or 25804111175 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 202201010011212 its reverse (212110010102202), we get a palindrome (414311020113414).
The spelling of 202201010011212 in words is "two hundred two trillion, two hundred one billion, ten million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •