Base | Representation |
---|---|
bin | 1100110101001001000110… |
… | …1010110001000010100011 |
3 | 1211221121221012112022202122 |
4 | 3031102101222301002203 |
5 | 3322112333311213144 |
6 | 50000415253334455 |
7 | 2654130332551544 |
oct | 315222152610243 |
9 | 54847835468678 |
10 | 14107116507299 |
11 | 4549881550a82 |
12 | 16ba07893742b |
13 | 7b43abc3c84a |
14 | 36ab066d64cb |
15 | 196e59cb77ee |
hex | cd491ab10a3 |
14107116507299 has 8 divisors (see below), whose sum is σ = 14563161080832. Its totient is φ = 13651132952520.
The previous prime is 14107116507247. The next prime is 14107116507317. The reversal of 14107116507299 is 99270561170141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14107116507299 - 216 = 14107116441763 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14107116507299.
It is not an unprimeable number, because it can be changed into a prime (14107116507599) 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, 14784599 + ... + 15709824.
It is an arithmetic number, because the mean of its divisors is an integer number (1820395135104).
Almost surely, 214107116507299 is an apocalyptic number.
14107116507299 is a deficient number, since it is larger than the sum of its proper divisors (456044573533).
14107116507299 is a wasteful number, since it uses less digits than its factorization.
14107116507299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30509377.
The product of its (nonzero) digits is 952560, while the sum is 53.
The spelling of 14107116507299 in words is "fourteen trillion, one hundred seven billion, one hundred sixteen million, five hundred seven thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •