Base | Representation |
---|---|
bin | 11010000101000100… |
… | …10111001100101111 |
3 | 1100010202201221222112 |
4 | 31002202113030233 |
5 | 212133302043223 |
6 | 10233154234235 |
7 | 1003651200515 |
oct | 150242271457 |
9 | 40122657875 |
10 | 14001206063 |
11 | 5a35352389 |
12 | 2868b8597b |
13 | 1421941b20 |
14 | 96b70c4b5 |
15 | 56e2c0778 |
hex | 34289732f |
14001206063 has 8 divisors (see below), whose sum is σ = 15111810000. Its totient is φ = 12895400448.
The previous prime is 14001206033. The next prime is 14001206083. The reversal of 14001206063 is 36060210041.
It is a happy number.
14001206063 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 not a de Polignac number, because 14001206063 - 214 = 14001189679 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14001206033) 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, 1193513 + ... + 1205186.
It is an arithmetic number, because the mean of its divisors is an integer number (1888976250).
Almost surely, 214001206063 is an apocalyptic number.
14001206063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14001206063 is a deficient number, since it is larger than the sum of its proper divisors (1110603937).
14001206063 is a wasteful number, since it uses less digits than its factorization.
14001206063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2399161.
The product of its (nonzero) digits is 864, while the sum is 23.
The spelling of 14001206063 in words is "fourteen billion, one million, two hundred six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •