Base | Representation |
---|---|
bin | 11010101000101111… |
… | …10101100000110000 |
3 | 1100220121210110000100 |
4 | 31110113311200300 |
5 | 213241402432103 |
6 | 10323003552400 |
7 | 1014243463530 |
oct | 152427654060 |
9 | 40817713010 |
10 | 14300436528 |
11 | 6079250694 |
12 | 293122b700 |
13 | 146b930581 |
14 | 9993614c0 |
15 | 58a6cb5a3 |
hex | 3545f5830 |
14300436528 has 120 divisors (see below), whose sum is σ = 46290037248. Its totient is φ = 4036588416.
The previous prime is 14300436503. The next prime is 14300436539. The reversal of 14300436528 is 82563400341.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 14300436492 and 14300436501.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1800 + ... + 169127.
Almost surely, 214300436528 is an apocalyptic number.
14300436528 is a gapful number since it is divisible by the number (18) 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 14300436528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23145018624).
14300436528 is an abundant number, since it is smaller than the sum of its proper divisors (31989600720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14300436528 is a wasteful number, since it uses less digits than its factorization.
14300436528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171031 (or 171022 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
Adding to 14300436528 its reverse (82563400341), we get a palindrome (96863836869).
The spelling of 14300436528 in words is "fourteen billion, three hundred million, four hundred thirty-six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •