Base | Representation |
---|---|
bin | 1111111000100000101… |
… | …00000101000100000000 |
3 | 1221011122011211100112011 |
4 | 13330100110011010000 |
5 | 32420131020430124 |
6 | 1054412413142304 |
7 | 54266545046230 |
oct | 7742024050400 |
9 | 1834564740464 |
10 | 545734545664 |
11 | 1a0498a18580 |
12 | 8992548a994 |
13 | 3c6022a5309 |
14 | 1c5b125dcc0 |
15 | e2e0cb9994 |
hex | 7f10505100 |
545734545664 has 432 divisors, whose sum is σ = 1413665197056. Its totient is φ = 204231168000.
The previous prime is 545734545571. The next prime is 545734545667. The reversal of 545734545664 is 466545437545.
It is a junction number, because it is equal to n+sod(n) for n = 545734545599 and 545734545608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545734545667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3614135989 + ... + 3614136139.
Almost surely, 2545734545664 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 545734545664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (706832598528).
545734545664 is an abundant number, since it is smaller than the sum of its proper divisors (867930651392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545734545664 is a wasteful number, since it uses less digits than its factorization.
545734545664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362 (or 301 counting only the distinct ones).
The product of its digits is 120960000, while the sum is 58.
The spelling of 545734545664 in words is "five hundred forty-five billion, seven hundred thirty-four million, five hundred forty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •