Base | Representation |
---|---|
bin | 1010000110111011010100… |
… | …1011111111001011011010 |
3 | 1110100111111010222011122202 |
4 | 2201232311023333023122 |
5 | 2424043204233310320 |
6 | 35345431211450202 |
7 | 2224653155040230 |
oct | 241566513771332 |
9 | 43314433864582 |
10 | 11114120213210 |
11 | 35a5521130203 |
12 | 12b5ba8456962 |
13 | 628098412631 |
14 | 2a5cd7a42950 |
15 | 144185370b75 |
hex | a1bb52ff2da |
11114120213210 has 64 divisors (see below), whose sum is σ = 23225782993920. Its totient is φ = 3750451511040.
The previous prime is 11114120213177. The next prime is 11114120213213. The reversal of 11114120213210 is 1231202141111.
It is a happy number.
It is a super-2 number, since 2×111141202132102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11114120213213) 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, 1417001 + ... + 4923020.
It is an arithmetic number, because the mean of its divisors is an integer number (362902859280).
Almost surely, 211114120213210 is an apocalyptic number.
11114120213210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11114120213210 is an abundant number, since it is smaller than the sum of its proper divisors (12111662780710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11114120213210 is a wasteful number, since it uses less digits than its factorization.
11114120213210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6340431.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 11114120213210 its reverse (1231202141111), we get a palindrome (12345322354321).
The spelling of 11114120213210 in words is "eleven trillion, one hundred fourteen billion, one hundred twenty million, two hundred thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •