Base | Representation |
---|---|
bin | 1010001100101000000100… |
… | …0100111110111111100100 |
3 | 1110200212012122220100111220 |
4 | 2203022001010332333210 |
5 | 2432144214213210040 |
6 | 35502422514500340 |
7 | 2235020363216043 |
oct | 243120104767744 |
9 | 43625178810456 |
10 | 11212030210020 |
11 | 3632aa4835a42 |
12 | 1310b722946b0 |
13 | 63439cc244a3 |
14 | 2aa94529a55a |
15 | 1469b5d6a2d0 |
hex | a328113efe4 |
11212030210020 has 48 divisors (see below), whose sum is σ = 32476225440960. Its totient is φ = 2886775593856.
The previous prime is 11212030210019. The next prime is 11212030210091. The reversal of 11212030210020 is 2001203021211.
It is a super-2 number, since 2×112120302100202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3221846022 + ... + 3221849501.
It is an arithmetic number, because the mean of its divisors is an integer number (676588030020).
Almost surely, 211212030210020 is an apocalyptic number.
11212030210020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212030210020 is an abundant number, since it is smaller than the sum of its proper divisors (21264195230940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212030210020 is a wasteful number, since it uses less digits than its factorization.
11212030210020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6443695564 (or 6443695562 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11212030210020 its reverse (2001203021211), we get a palindrome (13213233231231).
The spelling of 11212030210020 in words is "eleven trillion, two hundred twelve billion, thirty million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •