Base | Representation |
---|---|
bin | 11010010110100101… |
… | …00111100000010000 |
3 | 1100112000002121012210 |
4 | 31023102213200100 |
5 | 212433401322423 |
6 | 10255522152120 |
7 | 1010413432443 |
oct | 151322474020 |
9 | 40460077183 |
10 | 14148073488 |
11 | 600024501a |
12 | 28aa1b2640 |
13 | 14461b4c23 |
14 | 98301d65a |
15 | 57c131b93 |
hex | 34b4a7810 |
14148073488 has 20 divisors (see below), whose sum is σ = 36549189968. Its totient is φ = 4716024480.
The previous prime is 14148073469. The next prime is 14148073507. The reversal of 14148073488 is 88437084141.
It is an interprime number because it is at equal distance from previous prime (14148073469) and next prime (14148073507).
It is a super-2 number, since 2×141480734882 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 294751531 = 14148073488 / (1 + 4 + 1 + 4 + 8 + 0 + 7 + 3 + 4 + 8 + 8).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147375718 + ... + 147375813.
Almost surely, 214148073488 is an apocalyptic number.
It is an amenable number.
14148073488 is an abundant number, since it is smaller than the sum of its proper divisors (22401116480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14148073488 is a wasteful number, since it uses less digits than its factorization.
14148073488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294751542 (or 294751536 counting only the distinct ones).
The product of its (nonzero) digits is 688128, while the sum is 48.
The spelling of 14148073488 in words is "fourteen billion, one hundred forty-eight million, seventy-three thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •