Base | Representation |
---|---|
bin | 11001001111011011111111… |
… | …011011110011001101000001 |
3 | 112120001122101212022002120220 |
4 | 121033123333123303031001 |
5 | 104022310044103210423 |
6 | 1032034114034453253 |
7 | 32245232046415455 |
oct | 3117337733631501 |
9 | 476048355262526 |
10 | 111012010210113 |
11 | 3240aa24760771 |
12 | 1054aa55734229 |
13 | 49c3506867bac |
14 | 1d5b01d4a2665 |
15 | cc7a255649e3 |
hex | 64f6ff6f3341 |
111012010210113 has 32 divisors (see below), whose sum is σ = 155874797521920. Its totient is φ = 70189235128320.
The previous prime is 111012010210093. The next prime is 111012010210181. The reversal of 111012010210113 is 311012010210111.
It is not a de Polignac number, because 111012010210113 - 25 = 111012010210081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111012010210092 and 111012010210101.
It is not an unprimeable number, because it can be changed into a prime (111012010210183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58410306 + ... + 60280907.
It is an arithmetic number, because the mean of its divisors is an integer number (4871087422560).
Almost surely, 2111012010210113 is an apocalyptic number.
It is an amenable number.
111012010210113 is a deficient number, since it is larger than the sum of its proper divisors (44862787311807).
111012010210113 is a wasteful number, since it uses less digits than its factorization.
111012010210113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118691449.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 111012010210113 its reverse (311012010210111), we get a palindrome (422024020420224).
The spelling of 111012010210113 in words is "one hundred eleven trillion, twelve billion, ten million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •