Base | Representation |
---|---|
bin | 110010111000010111… |
… | …010110000000100001 |
3 | 12020000110010110222111 |
4 | 302320113112000201 |
5 | 1343341440003003 |
6 | 41033053035321 |
7 | 3642564404032 |
oct | 627027260041 |
9 | 166013113874 |
10 | 54632734753 |
11 | 21195833263 |
12 | a708485b41 |
13 | 51c87ab9ac |
14 | 2903b0ca89 |
15 | 164b451e6d |
hex | cb85d6021 |
54632734753 has 4 divisors (see below), whose sum is σ = 54642859200. Its totient is φ = 54622610308.
The previous prime is 54632734733. The next prime is 54632734759. The reversal of 54632734753 is 35743723645.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 54632734753 - 25 = 54632734721 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54632734697 and 54632734706.
It is not an unprimeable number, because it can be changed into a prime (54632734759) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5054125 + ... + 5064922.
It is an arithmetic number, because the mean of its divisors is an integer number (13660714800).
Almost surely, 254632734753 is an apocalyptic number.
It is an amenable number.
54632734753 is a deficient number, since it is larger than the sum of its proper divisors (10124447).
54632734753 is a wasteful number, since it uses less digits than its factorization.
54632734753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10124446.
The product of its digits is 6350400, while the sum is 49.
The spelling of 54632734753 in words is "fifty-four billion, six hundred thirty-two million, seven hundred thirty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •