Base | Representation |
---|---|
bin | 11010011101100111… |
… | …000010111110100101 |
3 | 2201100020001221010020 |
4 | 122131213002332211 |
5 | 431143000000001 |
6 | 21015255545353 |
7 | 2024061355236 |
oct | 323547027645 |
9 | 81306057106 |
10 | 28414062501 |
11 | 11060aa7790 |
12 | 560b98b259 |
13 | 28aa944046 |
14 | 153797508d |
15 | b147a6736 |
hex | 69d9c2fa5 |
28414062501 has 8 divisors (see below), whose sum is σ = 41329545504. Its totient is φ = 17220643920.
The previous prime is 28414062499. The next prime is 28414062503. The reversal of 28414062501 is 10526041482.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (28414062499) and next prime (28414062503).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28414062501 - 21 = 28414062499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 861032197 = 28414062501 / (2 + 8 + 4 + 1 + 4 + 0 + 6 + 2 + 5 + 0 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28414062503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 430516066 + ... + 430516131.
It is an arithmetic number, because the mean of its divisors is an integer number (5166193188).
Almost surely, 228414062501 is an apocalyptic number.
It is an amenable number.
28414062501 is a deficient number, since it is larger than the sum of its proper divisors (12915483003).
28414062501 is a wasteful number, since it uses less digits than its factorization.
28414062501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 861032211.
The product of its (nonzero) digits is 15360, while the sum is 33.
The spelling of 28414062501 in words is "twenty-eight billion, four hundred fourteen million, sixty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •