Base | Representation |
---|---|
bin | 1001001100001111111111… |
… | …01101110100101110110110 |
3 | 2122120020222210100111212110 |
4 | 10212013333231310232312 |
5 | 10122123401000031410 |
6 | 110553152112031450 |
7 | 4154163650414361 |
oct | 446077755645666 |
9 | 78506883314773 |
10 | 20212111330230 |
11 | 64929a9a0a966 |
12 | 23252ab232586 |
13 | b37cbc8473b1 |
14 | 4dc3b2a5b0d8 |
15 | 250b6b71c720 |
hex | 1261ffb74bb6 |
20212111330230 has 64 divisors (see below), whose sum is σ = 51183464428800. Its totient is φ = 5094088755840.
The previous prime is 20212111330183. The next prime is 20212111330231. The reversal of 20212111330230 is 3203311121202.
It is a super-2 number, since 2×202121113302302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20212111330197 and 20212111330206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212111330231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41873860 + ... + 42353799.
It is an arithmetic number, because the mean of its divisors is an integer number (799741631700).
Almost surely, 220212111330230 is an apocalyptic number.
20212111330230 is an abundant number, since it is smaller than the sum of its proper divisors (30971353098570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20212111330230 is a wasteful number, since it uses less digits than its factorization.
20212111330230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84228109.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20212111330230 its reverse (3203311121202), we get a palindrome (23415422451432).
The spelling of 20212111330230 in words is "twenty trillion, two hundred twelve billion, one hundred eleven million, three hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •