Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0100111010110001101 |
3 | 100200000020022221001211 |
4 | 1132023032213112031 |
5 | 3124043222041023 |
6 | 114242014534421 |
7 | 10206564525124 |
oct | 1361316472615 |
9 | 320006287054 |
10 | 101120112013 |
11 | 39980737908 |
12 | 17720b07411 |
13 | 96c68b280b |
14 | 4c73b16abb |
15 | 296c744a0d |
hex | 178b3a758d |
101120112013 has 2 divisors, whose sum is σ = 101120112014. Its totient is φ = 101120112012.
The previous prime is 101120111987. The next prime is 101120112019. The reversal of 101120112013 is 310211021101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78141493444 + 22978618569 = 279538^2 + 151587^2 .
It is a cyclic number.
It is not a de Polignac number, because 101120112013 - 221 = 101118014861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101120111984 and 101120112002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101120112019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560056006 + 50560056007.
It is an arithmetic number, because the mean of its divisors is an integer number (50560056007).
Almost surely, 2101120112013 is an apocalyptic number.
It is an amenable number.
101120112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120112013 is an equidigital number, since it uses as much as digits as its factorization.
101120112013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101120112013 its reverse (310211021101), we get a palindrome (411331133114).
The spelling of 101120112013 in words is "one hundred one billion, one hundred twenty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •