Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …11011010000011110001 |
3 | 10120122212000021021210000 |
4 | 32231222313122003301 |
5 | 113031223204132423 |
6 | 2052255253100213 |
7 | 133023153045663 |
oct | 16555267320361 |
9 | 3518760237700 |
10 | 1011110224113 |
11 | 35a89a3a87a0 |
12 | 143b62927669 |
13 | 74468ca6552 |
14 | 36d1bc0a533 |
15 | 1b47bd29843 |
hex | eb6adda0f1 |
1011110224113 has 80 divisors (see below), whose sum is σ = 1705326955200. Its totient is φ = 591394849920.
The previous prime is 1011110224097. The next prime is 1011110224129. The reversal of 1011110224113 is 3114220111101.
It is an interprime number because it is at equal distance from previous prime (1011110224097) and next prime (1011110224129).
It is not a de Polignac number, because 1011110224113 - 24 = 1011110224097 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1011110224213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 66631195 + ... + 66646367.
It is an arithmetic number, because the mean of its divisors is an integer number (21316586940).
Almost surely, 21011110224113 is an apocalyptic number.
It is an amenable number.
1011110224113 is a deficient number, since it is larger than the sum of its proper divisors (694216731087).
1011110224113 is a wasteful number, since it uses less digits than its factorization.
1011110224113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17804 (or 17795 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1011110224113 its reverse (3114220111101), we get a palindrome (4125330335214).
The spelling of 1011110224113 in words is "one trillion, eleven billion, one hundred ten million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •