Base | Representation |
---|---|
bin | 100110111101101100000… |
… | …0111011001111011101001 |
3 | 200221221120222001001100111 |
4 | 1031323120013121323221 |
5 | 1200214324144230242 |
6 | 15220042502134321 |
7 | 1061616510024055 |
oct | 115733007317351 |
9 | 20857528031314 |
10 | 5355155070697 |
11 | 1785121479813 |
12 | 725a467213a1 |
13 | 2cacb1977383 |
14 | 147295b24c65 |
15 | 9447710d817 |
hex | 4ded81d9ee9 |
5355155070697 has 2 divisors, whose sum is σ = 5355155070698. Its totient is φ = 5355155070696.
The previous prime is 5355155070689. The next prime is 5355155070737. The reversal of 5355155070697 is 7960705515535.
5355155070697 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4321392809616 + 1033762261081 = 2078796^2 + 1016741^2 .
It is a cyclic number.
It is not a de Polignac number, because 5355155070697 - 23 = 5355155070689 is a prime.
It is a super-3 number, since 3×53551550706973 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5355155070637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2677577535348 + 2677577535349.
It is an arithmetic number, because the mean of its divisors is an integer number (2677577535349).
Almost surely, 25355155070697 is an apocalyptic number.
It is an amenable number.
5355155070697 is a deficient number, since it is larger than the sum of its proper divisors (1).
5355155070697 is an equidigital number, since it uses as much as digits as its factorization.
5355155070697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24806250, while the sum is 58.
The spelling of 5355155070697 in words is "five trillion, three hundred fifty-five billion, one hundred fifty-five million, seventy thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •