Base | Representation |
---|---|
bin | 1001000110010111111100… |
… | …01011111101010001101010 |
3 | 2121211221212210100200121200 |
4 | 10203023332023331101222 |
5 | 10110321413341242302 |
6 | 110320322535345030 |
7 | 4133455650262545 |
oct | 443137613752152 |
9 | 77757783320550 |
10 | 20010222212202 |
11 | 64153188563a2 |
12 | 22b2146b22176 |
13 | b21c57034801 |
14 | 4d26ddb0585c |
15 | 24a7a24d981c |
hex | 1232fe2fd46a |
20010222212202 has 48 divisors (see below), whose sum is σ = 44968115253672. Its totient is φ = 6425546313600.
The previous prime is 20010222212153. The next prime is 20010222212209. The reversal of 20010222212202 is 20221222201002.
20010222212202 is a `hidden beast` number, since 20 + 0 + 10 + 222 + 212 + 202 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 16678067686641 + 3332154525561 = 4083879^2 + 1825419^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (20010222212209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 148672233 + ... + 148806764.
Almost surely, 220010222212202 is an apocalyptic number.
20010222212202 is an abundant number, since it is smaller than the sum of its proper divisors (24957893041470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010222212202 is a wasteful number, since it uses less digits than its factorization.
20010222212202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297479143 (or 297479140 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 20010222212202 its reverse (20221222201002), we get a palindrome (40231444413204).
The spelling of 20010222212202 in words is "twenty trillion, ten billion, two hundred twenty-two million, two hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •