Base | Representation |
---|---|
bin | 11011001011101111… |
… | …01011110010100110 |
3 | 1101200002011220122002 |
4 | 31211313223302212 |
5 | 214342030413430 |
6 | 10412052005302 |
7 | 1024436636045 |
oct | 154567536246 |
9 | 41602156562 |
10 | 14593997990 |
11 | 6209a27770 |
12 | 29b3600832 |
13 | 14b76b5890 |
14 | 9c633a55c |
15 | 5a6367845 |
hex | 365debca6 |
14593997990 has 256 divisors, whose sum is σ = 34279096320. Its totient is φ = 4389396480.
The previous prime is 14593997987. The next prime is 14593998037. The reversal of 14593997990 is 9979939541.
It is a Harshad number since it is a multiple of its sum of digits (65).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 89533649 + ... + 89533811.
It is an arithmetic number, because the mean of its divisors is an integer number (133902720).
Almost surely, 214593997990 is an apocalyptic number.
14593997990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14593997990 is an abundant number, since it is smaller than the sum of its proper divisors (19685098330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14593997990 is a wasteful number, since it uses less digits than its factorization.
14593997990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367.
The product of its (nonzero) digits is 24800580, while the sum is 65.
The spelling of 14593997990 in words is "fourteen billion, five hundred ninety-three million, nine hundred ninety-seven thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •