Base | Representation |
---|---|
bin | 11010110000010101… |
… | …10111100101010001 |
3 | 1101002001200012222110 |
4 | 31120022313211101 |
5 | 213404210133001 |
6 | 10333201255533 |
7 | 1015646140452 |
oct | 153012674521 |
9 | 41061605873 |
10 | 14364146001 |
11 | 6101205547 |
12 | 294a6345a9 |
13 | 147bba8a9a |
14 | 9a39c7129 |
15 | 5910b33d6 |
hex | 3582b7951 |
14364146001 has 16 divisors (see below), whose sum is σ = 20449668096. Its totient is φ = 8946726096.
The previous prime is 14364145993. The next prime is 14364146009. The reversal of 14364146001 is 10064146341.
14364146001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (14364145993) and next prime (14364146009).
It is not a de Polignac number, because 14364146001 - 23 = 14364145993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14364146001.
It is not an unprimeable number, because it can be changed into a prime (14364146009) 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 15 ways as a sum of consecutive naturals, for example, 2417685 + ... + 2423618.
It is an arithmetic number, because the mean of its divisors is an integer number (1278104256).
Almost surely, 214364146001 is an apocalyptic number.
It is an amenable number.
14364146001 is a deficient number, since it is larger than the sum of its proper divisors (6085522095).
14364146001 is a wasteful number, since it uses less digits than its factorization.
14364146001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4841372.
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 14364146001 in words is "fourteen billion, three hundred sixty-four million, one hundred forty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •