Base | Representation |
---|---|
bin | 110100101110000100… |
… | …1001101001111011101 |
3 | 101211020011010022022101 |
4 | 1221130021031033131 |
5 | 3323331024121401 |
6 | 124002115445101 |
7 | 11115401122633 |
oct | 1513411151735 |
9 | 354204108271 |
10 | 113215067101 |
11 | 44017a54664 |
12 | 19b375b6791 |
13 | a8a3612786 |
14 | 56a01b1353 |
15 | 2e294c0101 |
hex | 1a5c24d3dd |
113215067101 has 2 divisors, whose sum is σ = 113215067102. Its totient is φ = 113215067100.
The previous prime is 113215067071. The next prime is 113215067143. The reversal of 113215067101 is 101760512311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97407034201 + 15808032900 = 312101^2 + 125730^2 .
It is a cyclic number.
It is not a de Polignac number, because 113215067101 - 29 = 113215066589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113215067101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113215667101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56607533550 + 56607533551.
It is an arithmetic number, because the mean of its divisors is an integer number (56607533551).
Almost surely, 2113215067101 is an apocalyptic number.
It is an amenable number.
113215067101 is a deficient number, since it is larger than the sum of its proper divisors (1).
113215067101 is an equidigital number, since it uses as much as digits as its factorization.
113215067101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1260, while the sum is 28.
Adding to 113215067101 its reverse (101760512311), we get a palindrome (214975579412).
The spelling of 113215067101 in words is "one hundred thirteen billion, two hundred fifteen million, sixty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •