Base | Representation |
---|---|
bin | 1101000011101001001101… |
… | …1111010001000000100001 |
3 | 1212211110000002211200221220 |
4 | 3100322103133101000201 |
5 | 3340203102304300423 |
6 | 50311101135205253 |
7 | 3011130246226062 |
oct | 320722337210041 |
9 | 55743002750856 |
10 | 14356255150113 |
11 | 46354a9846888 |
12 | 173a408976829 |
13 | 801a34714c16 |
14 | 378bbc96a569 |
15 | 19d68c1899e3 |
hex | d0e937d1021 |
14356255150113 has 8 divisors (see below), whose sum is σ = 19659016061568. Its totient is φ = 9312165502704.
The previous prime is 14356255150087. The next prime is 14356255150129. The reversal of 14356255150113 is 31105155265341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14356255150113 - 214 = 14356255133729 is a prime.
It is a super-2 number, since 2×143562551501132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14356255150183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64667815881 + ... + 64667816102.
It is an arithmetic number, because the mean of its divisors is an integer number (2457377007696).
Almost surely, 214356255150113 is an apocalyptic number.
It is an amenable number.
14356255150113 is a deficient number, since it is larger than the sum of its proper divisors (5302760911455).
14356255150113 is a wasteful number, since it uses less digits than its factorization.
14356255150113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129335632023.
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 14356255150113 in words is "fourteen trillion, three hundred fifty-six billion, two hundred fifty-five million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •