Base | Representation |
---|---|
bin | 100110111101110011101… |
… | …1111110011100011010111 |
3 | 200221222020221121120202200 |
4 | 1031323213133303203113 |
5 | 1200220341230002320 |
6 | 15220124241135543 |
7 | 1061626062324000 |
oct | 115734737634327 |
9 | 20858227546680 |
10 | 5355413125335 |
11 | 1785244104009 |
12 | 725ab902a5b3 |
13 | 2cb02327a020 |
14 | 1472bc0da1a7 |
15 | 9448ead4290 |
hex | 4dee77f38d7 |
5355413125335 has 192 divisors, whose sum is σ = 12060056736000. Its totient is φ = 2181937830912.
The previous prime is 5355413125301. The next prime is 5355413125343. The reversal of 5355413125335 is 5335213145535.
5355413125335 is a `hidden beast` number, since 5 + 3 + 554 + 1 + 3 + 12 + 53 + 35 = 666.
It is not a de Polignac number, because 5355413125335 - 27 = 5355413125207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 5358829 + ... + 6279161.
It is an arithmetic number, because the mean of its divisors is an integer number (62812795500).
Almost surely, 25355413125335 is an apocalyptic number.
5355413125335 is an abundant number, since it is smaller than the sum of its proper divisors (6704643610665).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5355413125335 is a wasteful number, since it uses less digits than its factorization.
5355413125335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920407 (or 920390 counting only the distinct ones).
The product of its digits is 2025000, while the sum is 45.
The spelling of 5355413125335 in words is "five trillion, three hundred fifty-five billion, four hundred thirteen million, one hundred twenty-five thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •