Base | Representation |
---|---|
bin | 11011100100110001… |
… | …00011001111011000 |
3 | 1102012201020002100122 |
4 | 31302120203033120 |
5 | 220304302042222 |
6 | 10444551452412 |
7 | 1032566262560 |
oct | 156230431730 |
9 | 42181202318 |
10 | 14803940312 |
11 | 6307490517 |
12 | 2a51987108 |
13 | 151c0413c5 |
14 | a06189da0 |
15 | 5b99d7a42 |
hex | 3726233d8 |
14803940312 has 32 divisors (see below), whose sum is σ = 32079175200. Its totient is φ = 6273256704.
The previous prime is 14803940303. The next prime is 14803940321. The reversal of 14803940312 is 21304930841.
14803940312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (14803940303) and next prime (14803940321).
It is a super-2 number, since 2×148039403122 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1480163 + ... + 1490130.
It is an arithmetic number, because the mean of its divisors is an integer number (1002474225).
Almost surely, 214803940312 is an apocalyptic number.
It is an amenable number.
14803940312 is an abundant number, since it is smaller than the sum of its proper divisors (17275234888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14803940312 is a wasteful number, since it uses less digits than its factorization.
14803940312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2970395 (or 2970391 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 14803940312 in words is "fourteen billion, eight hundred three million, nine hundred forty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •