Base | Representation |
---|---|
bin | 11010110100011111… |
… | …01010000111101100 |
3 | 1101011111011202100010 |
4 | 31122033222013230 |
5 | 213442113043022 |
6 | 10340443333220 |
7 | 1016551051410 |
oct | 153217520754 |
9 | 41144152303 |
10 | 14398956012 |
11 | 6119920851 |
12 | 295a221210 |
13 | 148617621c |
14 | 9a8488d40 |
15 | 59418c50c |
hex | 35a3ea1ec |
14398956012 has 96 divisors (see below), whose sum is σ = 39669575680. Its totient is φ = 3977890560.
The previous prime is 14398955993. The next prime is 14398956071. The reversal of 14398956012 is 21065989341.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5907258 + ... + 5909694.
Almost surely, 214398956012 is an apocalyptic number.
14398956012 is a gapful number since it is divisible by the number (12) 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 14398956012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19834787840).
14398956012 is an abundant number, since it is smaller than the sum of its proper divisors (25270619668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14398956012 is a wasteful number, since it uses less digits than its factorization.
14398956012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4751 (or 4749 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 48.
The spelling of 14398956012 in words is "fourteen billion, three hundred ninety-eight million, nine hundred fifty-six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •