Base | Representation |
---|---|
bin | 1101000001001011111101… |
… | …0000110111111111001111 |
3 | 1212200102001001101220112220 |
4 | 3100102333100313333033 |
5 | 3334010123203332114 |
6 | 50235440144030423 |
7 | 3005104152441324 |
oct | 320227720677717 |
9 | 55612031356486 |
10 | 14314039902159 |
11 | 46196063a4208 |
12 | 17321a7002413 |
13 | 7caa6772286a |
14 | 376b360b2b4b |
15 | 19c51ae730a9 |
hex | d04bf437fcf |
14314039902159 has 16 divisors (see below), whose sum is σ = 19184924166144. Its totient is φ = 9492967310400.
The previous prime is 14314039902091. The next prime is 14314039902167. The reversal of 14314039902159 is 95120993041341.
It is not a de Polignac number, because 14314039902159 - 221 = 14314037805007 is a prime.
It is a super-2 number, since 2×143140399021592 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14314039904159) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4019734 + ... + 6692259.
It is an arithmetic number, because the mean of its divisors is an integer number (1199057760384).
Almost surely, 214314039902159 is an apocalyptic number.
14314039902159 is a deficient number, since it is larger than the sum of its proper divisors (4870884263985).
14314039902159 is a wasteful number, since it uses less digits than its factorization.
14314039902159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10714318.
The product of its (nonzero) digits is 1049760, while the sum is 51.
The spelling of 14314039902159 in words is "fourteen trillion, three hundred fourteen billion, thirty-nine million, nine hundred two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •