Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …0100000001010000011011 |
3 | 1110100022000101102020100111 |
4 | 2201230312310001100123 |
5 | 2424024334000013201 |
6 | 35344440552145151 |
7 | 2224546501401535 |
oct | 241546664012033 |
9 | 43308011366314 |
10 | 11112000001051 |
11 | 35a4633347454 |
12 | 12b56b63981b7 |
13 | 627b1b098921 |
14 | 2a5b76214855 |
15 | 1440ae164b51 |
hex | a1b36d0141b |
11112000001051 has 2 divisors, whose sum is σ = 11112000001052. Its totient is φ = 11112000001050.
The previous prime is 11112000001043. The next prime is 11112000001117. The reversal of 11112000001051 is 15010000021111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11112000001051 - 23 = 11112000001043 is a prime.
It is a super-2 number, since 2×111120000010512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11112000001001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556000000525 + 5556000000526.
It is an arithmetic number, because the mean of its divisors is an integer number (5556000000526).
Almost surely, 211112000001051 is an apocalyptic number.
11112000001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112000001051 is an equidigital number, since it uses as much as digits as its factorization.
11112000001051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 11112000001051 its reverse (15010000021111), we get a palindrome (26122000022162).
The spelling of 11112000001051 in words is "eleven trillion, one hundred twelve billion, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •