Base | Representation |
---|---|
bin | 11010110100011001… |
… | …01000101010101011 |
3 | 1101011102200111101112 |
4 | 31122030220222223 |
5 | 213441412214002 |
6 | 10340414340535 |
7 | 1016541241301 |
oct | 153214505253 |
9 | 41142614345 |
10 | 14398163627 |
11 | 611942a491 |
12 | 2959aba74b |
13 | 1485c59663 |
14 | 9a8320271 |
15 | 594082852 |
hex | 35a328aab |
14398163627 has 8 divisors (see below), whose sum is σ = 14697660672. Its totient is φ = 14101353000.
The previous prime is 14398163603. The next prime is 14398163657. The reversal of 14398163627 is 72636189341.
14398163627 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14398163627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14398163657) by changing a digit.
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, 660773 + ... + 682214.
It is an arithmetic number, because the mean of its divisors is an integer number (1837207584).
Almost surely, 214398163627 is an apocalyptic number.
14398163627 is a deficient number, since it is larger than the sum of its proper divisors (299497045).
14398163627 is a wasteful number, since it uses less digits than its factorization.
14398163627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343209.
The product of its digits is 1306368, while the sum is 50.
The spelling of 14398163627 in words is "fourteen billion, three hundred ninety-eight million, one hundred sixty-three thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •