Base | Representation |
---|---|
bin | 100101010111100000110… |
… | …1011000011101010011001 |
3 | 200011222020012212011012101 |
4 | 1022233001223003222121 |
5 | 1133120441203133401 |
6 | 14531154005043401 |
7 | 1040021206666234 |
oct | 112570153035231 |
9 | 20158205764171 |
10 | 5135735208601 |
11 | 1700064700808 |
12 | 6ab40b3b6561 |
13 | 2b33b421374a |
14 | 13a7dc81441b |
15 | 8d8d3d16101 |
hex | 4abc1ac3a99 |
5135735208601 has 2 divisors, whose sum is σ = 5135735208602. Its totient is φ = 5135735208600.
The previous prime is 5135735208517. The next prime is 5135735208613. The reversal of 5135735208601 is 1068025375315.
5135735208601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3144419109001 + 1991316099600 = 1773251^2 + 1411140^2 .
It is a cyclic number.
It is not a de Polignac number, because 5135735208601 - 225 = 5135701654169 is a prime.
It is a super-2 number, since 2×51357352086012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5135735208641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2567867604300 + 2567867604301.
It is an arithmetic number, because the mean of its divisors is an integer number (2567867604301).
Almost surely, 25135735208601 is an apocalyptic number.
It is an amenable number.
5135735208601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5135735208601 is an equidigital number, since it uses as much as digits as its factorization.
5135735208601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756000, while the sum is 46.
The spelling of 5135735208601 in words is "five trillion, one hundred thirty-five billion, seven hundred thirty-five million, two hundred eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •