Base | Representation |
---|---|
bin | 110001110010001111… |
… | …100101010100000000 |
3 | 12002222110110011021000 |
4 | 301302033211110000 |
5 | 1333434302421133 |
6 | 40320225532000 |
7 | 3601461004023 |
oct | 616217452400 |
9 | 162873404230 |
10 | 53456295168 |
11 | 20741759841 |
12 | a43a4a4000 |
13 | 506bb463b3 |
14 | 28317931ba |
15 | 15cd01c413 |
hex | c723e5500 |
53456295168 has 144 divisors (see below), whose sum is σ = 160246656640. Its totient is φ = 17574506496.
The previous prime is 53456295163. The next prime is 53456295169. The reversal of 53456295168 is 86159265435.
53456295168 is a `hidden beast` number, since 5 + 3 + 4 + 5 + 629 + 5 + 1 + 6 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53456295163) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 451605 + ... + 557547.
Almost surely, 253456295168 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53456295168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80123328320).
53456295168 is an abundant number, since it is smaller than the sum of its proper divisors (106790361472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53456295168 is a wasteful number, since it uses less digits than its factorization.
53456295168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106041 (or 106021 counting only the distinct ones).
The product of its digits is 7776000, while the sum is 54.
The spelling of 53456295168 in words is "fifty-three billion, four hundred fifty-six million, two hundred ninety-five thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •