Base | Representation |
---|---|
bin | 11010101010011100… |
… | …10011010011000110 |
3 | 1100221121122211110002 |
4 | 31111032103103012 |
5 | 213304031324220 |
6 | 10324234001302 |
7 | 1014506030651 |
oct | 152516232306 |
9 | 40847584402 |
10 | 14314714310 |
11 | 6086312806 |
12 | 2935b76232 |
13 | 147188c270 |
14 | 99b1da898 |
15 | 58ba9bc75 |
hex | 3553934c6 |
14314714310 has 16 divisors (see below), whose sum is σ = 27748523376. Its totient is φ = 5285432928.
The previous prime is 14314714303. The next prime is 14314714363. The reversal of 14314714310 is 1341741341.
14314714310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×143147143102 (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, 55056464 + ... + 55056723.
It is an arithmetic number, because the mean of its divisors is an integer number (1734282711).
Almost surely, 214314714310 is an apocalyptic number.
14314714310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14314714310 is a deficient number, since it is larger than the sum of its proper divisors (13433809066).
14314714310 is a wasteful number, since it uses less digits than its factorization.
14314714310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110113207.
The product of its (nonzero) digits is 4032, while the sum is 29.
The spelling of 14314714310 in words is "fourteen billion, three hundred fourteen million, seven hundred fourteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •