Base | Representation |
---|---|
bin | 11000010011111010010000… |
… | …11101100101000001001000 |
3 | 21000021210100021011111211110 |
4 | 30021331020131211001020 |
5 | 24001344424423143124 |
6 | 305411254443530320 |
7 | 14155256221155324 |
oct | 1411751035450110 |
9 | 230253307144743 |
10 | 53460673646664 |
11 | 160415a96139a9 |
12 | 5bb50535299a0 |
13 | 23aa420a6158b |
14 | d2b7207d0984 |
15 | 62a97c719029 |
hex | 309f48765048 |
53460673646664 has 64 divisors (see below), whose sum is σ = 134387121024000. Its totient is φ = 17722215866880.
The previous prime is 53460673646657. The next prime is 53460673646689. The reversal of 53460673646664 is 46664637606435.
It is a happy number.
It is a super-2 number, since 2×534606736466642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53460673646595 and 53460673646604.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15729942 + ... + 18824250.
It is an arithmetic number, because the mean of its divisors is an integer number (2099798766000).
Almost surely, 253460673646664 is an apocalyptic number.
It is an amenable number.
53460673646664 is an abundant number, since it is smaller than the sum of its proper divisors (80926447377336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53460673646664 is a wasteful number, since it uses less digits than its factorization.
53460673646664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3098278 (or 3098274 counting only the distinct ones).
The product of its (nonzero) digits is 940584960, while the sum is 66.
The spelling of 53460673646664 in words is "fifty-three trillion, four hundred sixty billion, six hundred seventy-three million, six hundred forty-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •