Base | Representation |
---|---|
bin | 1010000110101100001010… |
… | …0111010011010100010101 |
3 | 1110100002222112002211111222 |
4 | 2201223002213103110111 |
5 | 2424011340412310401 |
6 | 35343515311540125 |
7 | 2224450260114464 |
oct | 241530247232425 |
9 | 43302875084458 |
10 | 11110050510101 |
11 | 35a3822969004 |
12 | 12b525152a645 |
13 | 62789a22759a |
14 | 2a5a2d3469db |
15 | 143ee7e2cc1b |
hex | a1ac29d3515 |
11110050510101 has 2 divisors, whose sum is σ = 11110050510102. Its totient is φ = 11110050510100.
The previous prime is 11110050510071. The next prime is 11110050510107. The reversal of 11110050510101 is 10101505001111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6622135369201 + 4487915140900 = 2573351^2 + 2118470^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110050510101 - 218 = 11110050247957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110050510101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110050510107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555025255050 + 5555025255051.
It is an arithmetic number, because the mean of its divisors is an integer number (5555025255051).
Almost surely, 211110050510101 is an apocalyptic number.
It is an amenable number.
11110050510101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110050510101 is an equidigital number, since it uses as much as digits as its factorization.
11110050510101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25, while the sum is 17.
Adding to 11110050510101 its reverse (10101505001111), we get a palindrome (21211555511212).
The spelling of 11110050510101 in words is "eleven trillion, one hundred ten billion, fifty million, five hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •