Base | Representation |
---|---|
bin | 11010001000100100… |
… | …00111110001110111 |
3 | 1100012210212101212102 |
4 | 31010102013301313 |
5 | 212213302044111 |
6 | 10240122212315 |
7 | 1004455210436 |
oct | 150422076167 |
9 | 40183771772 |
10 | 14030503031 |
11 | 5a4a942656 |
12 | 287695409b |
13 | 1427a2bacc |
14 | 97157711d |
15 | 571b5b13b |
hex | 344487c77 |
14030503031 has 16 divisors (see below), whose sum is σ = 14602556640. Its totient is φ = 13469829120.
The previous prime is 14030502973. The next prime is 14030503061. The reversal of 14030503031 is 13030503041.
It is a happy number.
14030503031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14030503031 - 214 = 14030486647 is a prime.
It is a super-2 number, since 2×140305030312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14030502994 and 14030503012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14030503061) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3395975 + ... + 3400103.
It is an arithmetic number, because the mean of its divisors is an integer number (912659790).
Almost surely, 214030503031 is an apocalyptic number.
14030503031 is a deficient number, since it is larger than the sum of its proper divisors (572053609).
14030503031 is a wasteful number, since it uses less digits than its factorization.
14030503031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5474.
The product of its (nonzero) digits is 540, while the sum is 20.
The spelling of 14030503031 in words is "fourteen billion, thirty million, five hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •