Base | Representation |
---|---|
bin | 1001000110000101001000… |
… | …01011001000010011101100 |
3 | 2121210222210220020101202020 |
4 | 10203002210023020103230 |
5 | 10110140222230024322 |
6 | 110311532415230140 |
7 | 4132650445655145 |
oct | 443024413102354 |
9 | 77728726211666 |
10 | 20000122111212 |
11 | 6411005590aa1 |
12 | 22b01a8518350 |
13 | b210076998a9 |
14 | 4d2022566acc |
15 | 24a3b095705c |
hex | 1230a42c84ec |
20000122111212 has 24 divisors (see below), whose sum is σ = 46667061534912. Its totient is φ = 6666691664400.
The previous prime is 20000122111157. The next prime is 20000122111243. The reversal of 20000122111212 is 21211122100002.
It is a super-2 number, since 2×200001221112122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20000122111191 and 20000122111200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4088887 + ... + 7531217.
It is an arithmetic number, because the mean of its divisors is an integer number (1944460897288).
Almost surely, 220000122111212 is an apocalyptic number.
It is an amenable number.
20000122111212 is an abundant number, since it is smaller than the sum of its proper divisors (26666939423700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000122111212 is a wasteful number, since it uses less digits than its factorization.
20000122111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3926509 (or 3926507 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20000122111212 its reverse (21211122100002), we get a palindrome (41211244211214).
The spelling of 20000122111212 in words is "twenty trillion, one hundred twenty-two million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •