Base | Representation |
---|---|
bin | 1010001011011001… |
… | …10110000000000000 |
3 | 112002211010210000000 |
4 | 11011230312000000 |
5 | 42142333210340 |
6 | 2302120000000 |
7 | 252261133443 |
oct | 50554660000 |
9 | 15084123000 |
10 | 5464350720 |
11 | 2354535634 |
12 | 1086000000 |
13 | 69111152a |
14 | 39ba1765a |
15 | 21eacbd30 |
hex | 145b36000 |
5464350720 has 448 divisors, whose sum is σ = 19989881280. Its totient is φ = 1433272320.
The previous prime is 5464350709. The next prime is 5464350739. The reversal of 5464350720 is 270534645.
5464350720 is a `hidden beast` number, since 5 + 4 + 643 + 5 + 0 + 7 + 2 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 89579490 + ... + 89579550.
Almost surely, 25464350720 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 5464350720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9994940640).
5464350720 is an abundant number, since it is smaller than the sum of its proper divisors (14525530560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5464350720 is an frugal number, since it uses more digits than its factorization.
5464350720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 36.
The square root of 5464350720 is about 73921.2467427329. The cubic root of 5464350720 is about 1761.3521289980.
The spelling of 5464350720 in words is "five billion, four hundred sixty-four million, three hundred fifty thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •