Base | Representation |
---|---|
bin | 1010001100101001000100… |
… | …1010010001000010100001 |
3 | 1110200212220110121122002200 |
4 | 2203022101022101002201 |
5 | 2432200242301430423 |
6 | 35502505354003413 |
7 | 2235030150520410 |
oct | 243122112210241 |
9 | 43625813548080 |
10 | 11212300030113 |
11 | 3633123076856 |
12 | 1311028716569 |
13 | 634413ab6450 |
14 | 2aa96d055477 |
15 | 1469ce8b6d43 |
hex | a32912910a1 |
11212300030113 has 96 divisors (see below), whose sum is σ = 20947795604736. Its totient is φ = 5620515070464.
The previous prime is 11212300030097. The next prime is 11212300030147. The reversal of 11212300030113 is 31103000321211.
11212300030113 is a `hidden beast` number, since 1 + 121 + 230 + 0 + 0 + 301 + 13 = 666.
It is not a de Polignac number, because 11212300030113 - 24 = 11212300030097 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11212300030153) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2999370 + ... + 5605427.
It is an arithmetic number, because the mean of its divisors is an integer number (218206204216).
Almost surely, 211212300030113 is an apocalyptic number.
11212300030113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11212300030113 is a deficient number, since it is larger than the sum of its proper divisors (9735495574623).
11212300030113 is a wasteful number, since it uses less digits than its factorization.
11212300030113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8604903 (or 8604900 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11212300030113 its reverse (31103000321211), we get a palindrome (42315300351324).
The spelling of 11212300030113 in words is "eleven trillion, two hundred twelve billion, three hundred million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •