Base | Representation |
---|---|
bin | 10101010001000101110… |
… | …01110000000000000000 |
3 | 2120212010211102101000000 |
4 | 22220202321300000000 |
5 | 43433013340120410 |
6 | 1315405344000000 |
7 | 103536112361220 |
oct | 12504271600000 |
9 | 2525124371000 |
10 | 730730004480 |
11 | 2619a0045913 |
12 | b9754000000 |
13 | 53ba4b48448 |
14 | 27520698080 |
15 | 1401bd2ddc0 |
hex | aa22e70000 |
730730004480 has 1904 divisors, whose sum is σ = 3300724293120. Its totient is φ = 151353556992.
The previous prime is 730730004463. The next prime is 730730004491. The reversal of 730730004480 is 84400037037.
730730004480 is a `hidden beast` number, since 7 + 307 + 300 + 0 + 4 + 48 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 12.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 31770869749 + ... + 31770869771.
Almost surely, 2730730004480 is an apocalyptic number.
730730004480 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 730730004480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1650362146560).
730730004480 is an abundant number, since it is smaller than the sum of its proper divisors (2569994288640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
730730004480 is an frugal number, since it uses more digits than its factorization.
730730004480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 36.
The spelling of 730730004480 in words is "seven hundred thirty billion, seven hundred thirty million, four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •