Base | Representation |
---|---|
bin | 11010111100010011… |
… | …10000111110000110 |
3 | 1101100001112202022120 |
4 | 31132021300332012 |
5 | 214110404120240 |
6 | 10351144510410 |
7 | 1021305251310 |
oct | 153611607606 |
9 | 41301482276 |
10 | 14464520070 |
11 | 6152932020 |
12 | 297817b406 |
13 | 1496920920 |
14 | 9b30747b0 |
15 | 599cddad0 |
hex | 35e270f86 |
14464520070 has 512 divisors, whose sum is σ = 49746493440. Its totient is φ = 2592000000.
The previous prime is 14464520027. The next prime is 14464520099. The reversal of 14464520070 is 7002546441.
It is a super-3 number, since 3×144645200703 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 57627445 + ... + 57627695.
It is an arithmetic number, because the mean of its divisors is an integer number (97161120).
Almost surely, 214464520070 is an apocalyptic number.
14464520070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14464520070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24873246720).
14464520070 is an abundant number, since it is smaller than the sum of its proper divisors (35281973370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14464520070 is a wasteful number, since it uses less digits than its factorization.
14464520070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412.
The product of its (nonzero) digits is 26880, while the sum is 33.
The spelling of 14464520070 in words is "fourteen billion, four hundred sixty-four million, five hundred twenty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •