Base | Representation |
---|---|
bin | 11011000000111110… |
… | …10000010100001000 |
3 | 1101102210021200221010 |
4 | 31200133100110020 |
5 | 214200422123122 |
6 | 10355104443520 |
7 | 1022262324501 |
oct | 154037202410 |
9 | 41383250833 |
10 | 14503707912 |
11 | 6172a68471 |
12 | 29893195a0 |
13 | 14a1a918b5 |
14 | 9b8355ba8 |
15 | 59d47ee0c |
hex | 3607d0508 |
14503707912 has 32 divisors (see below), whose sum is σ = 38167653600. Its totient is φ = 4580118144.
The previous prime is 14503707871. The next prime is 14503707929. The reversal of 14503707912 is 21970730541.
It is a super-2 number, since 2×145037079122 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15902733 + ... + 15903644.
It is an arithmetic number, because the mean of its divisors is an integer number (1192739175).
Almost surely, 214503707912 is an apocalyptic number.
14503707912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14503707912 is an abundant number, since it is smaller than the sum of its proper divisors (23663945688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14503707912 is a wasteful number, since it uses less digits than its factorization.
14503707912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31806405 (or 31806401 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 39.
The spelling of 14503707912 in words is "fourteen billion, five hundred three million, seven hundred seven thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •