Base | Representation |
---|---|
bin | 1101000011000101101001… |
… | …1000000000110111010110 |
3 | 1212210112100200100002021220 |
4 | 3100301122120000313112 |
5 | 3340024023443404303 |
6 | 50302441453351210 |
7 | 3010341526342626 |
oct | 320613230006726 |
9 | 55715320302256 |
10 | 14346707013078 |
11 | 463144a100140 |
12 | 17385a3198506 |
13 | 800b725273ab |
14 | 37855482c886 |
15 | 19d2cdcd7053 |
hex | d0c5a600dd6 |
14346707013078 has 32 divisors (see below), whose sum is σ = 31594447405440. Its totient is φ = 4306856252160.
The previous prime is 14346707013061. The next prime is 14346707013083. The reversal of 14346707013078 is 87031070764341.
It is a self number, because there is not a number n which added to its sum of digits gives 14346707013078.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1015760923 + ... + 1015775046.
It is an arithmetic number, because the mean of its divisors is an integer number (987326481420).
Almost surely, 214346707013078 is an apocalyptic number.
14346707013078 is an abundant number, since it is smaller than the sum of its proper divisors (17247740392362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14346707013078 is a wasteful number, since it uses less digits than its factorization.
14346707013078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2031536092.
The product of its (nonzero) digits is 2370816, while the sum is 51.
The spelling of 14346707013078 in words is "fourteen trillion, three hundred forty-six billion, seven hundred seven million, thirteen thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •