Base | Representation |
---|---|
bin | 11001110100001001110100… |
… | …100000011010100011011101 |
3 | 112212222211222201210121000022 |
4 | 121310021310200122203131 |
5 | 104340124411230010033 |
6 | 1041245151505241525 |
7 | 32625433055203301 |
oct | 3164116440324335 |
9 | 485884881717008 |
10 | 113535120156893 |
11 | 331a2a79524016 |
12 | 10897a4a0332a5 |
13 | 4b47415023246 |
14 | 20071b44c3d01 |
15 | d1d497e52098 |
hex | 67427481a8dd |
113535120156893 has 2 divisors, whose sum is σ = 113535120156894. Its totient is φ = 113535120156892.
The previous prime is 113535120156883. The next prime is 113535120156907. The reversal of 113535120156893 is 398651021535311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100532266390084 + 13002853766809 = 10026578^2 + 3605947^2 .
It is an emirp because it is prime and its reverse (398651021535311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113535120156893 - 246 = 43166375979229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113535120156883) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56767560078446 + 56767560078447.
It is an arithmetic number, because the mean of its divisors is an integer number (56767560078447).
Almost surely, 2113535120156893 is an apocalyptic number.
It is an amenable number.
113535120156893 is a deficient number, since it is larger than the sum of its proper divisors (1).
113535120156893 is an equidigital number, since it uses as much as digits as its factorization.
113535120156893 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916000, while the sum is 53.
The spelling of 113535120156893 in words is "one hundred thirteen trillion, five hundred thirty-five billion, one hundred twenty million, one hundred fifty-six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •