Base | Representation |
---|---|
bin | 1010001100001010101011… |
… | …0110111000000011000010 |
3 | 1110200002211212101010201121 |
4 | 2203002222312320003002 |
5 | 2432032040123020114 |
6 | 35455040022222454 |
7 | 2234321031005200 |
oct | 243025266700302 |
9 | 43602755333647 |
10 | 11204141220034 |
11 | 362a71669a004 |
12 | 130b530284a2a |
13 | 6337136ab389 |
14 | 2aa3d764c070 |
15 | 1466a349ba24 |
hex | a30aadb80c2 |
11204141220034 has 48 divisors (see below), whose sum is σ = 20033440922880. Its totient is φ = 4683131691840.
The previous prime is 11204141220031. The next prime is 11204141220043. The reversal of 11204141220034 is 43002214140211.
It is a super-2 number, since 2×112041412200342 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11204141219990 and 11204141220008.
It is not an unprimeable number, because it can be changed into a prime (11204141220031) 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, 11918599 + ... + 12824245.
It is an arithmetic number, because the mean of its divisors is an integer number (417363352560).
Almost surely, 211204141220034 is an apocalyptic number.
11204141220034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11204141220034 is a deficient number, since it is larger than the sum of its proper divisors (8829299702846).
11204141220034 is a wasteful number, since it uses less digits than its factorization.
11204141220034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 908783 (or 908776 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11204141220034 its reverse (43002214140211), we get a palindrome (54206355360245).
The spelling of 11204141220034 in words is "eleven trillion, two hundred four billion, one hundred forty-one million, two hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •