Base | Representation |
---|---|
bin | 11011001101000110… |
… | …10010111000110000 |
3 | 1101200212200201211201 |
4 | 31212203102320300 |
5 | 214402442232240 |
6 | 10413141020544 |
7 | 1024636052335 |
oct | 154643227060 |
9 | 41625621751 |
10 | 14605430320 |
11 | 6215425a78 |
12 | 29b73b4754 |
13 | 14b9b89380 |
14 | 9c7a7498c |
15 | 5a7374d9a |
hex | 3668d2e30 |
14605430320 has 320 divisors, whose sum is σ = 40396164480. Its totient is φ = 4860739584.
The previous prime is 14605430317. The next prime is 14605430327. The reversal of 14605430320 is 2303450641.
It is not an unprimeable number, because it can be changed into a prime (14605430327) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 54295146 + ... + 54295414.
It is an arithmetic number, because the mean of its divisors is an integer number (126238014).
Almost surely, 214605430320 is an apocalyptic number.
14605430320 is a gapful number since it is divisible by the number (10) 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 14605430320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20198082240).
14605430320 is an abundant number, since it is smaller than the sum of its proper divisors (25790734160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14605430320 is a wasteful number, since it uses less digits than its factorization.
14605430320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 432 (or 426 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 14605430320 its reverse (2303450641), we get a palindrome (16908880961).
The spelling of 14605430320 in words is "fourteen billion, six hundred five million, four hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •