Base | Representation |
---|---|
bin | 11010000101000011… |
… | …10100100100001001 |
3 | 1100010202110202101101 |
4 | 31002201310210021 |
5 | 212133233023301 |
6 | 10233151221401 |
7 | 1003650040105 |
oct | 150241644411 |
9 | 40122422341 |
10 | 14001064201 |
11 | 5a35265843 |
12 | 2868b17861 |
13 | 14218c2397 |
14 | 96b6b2905 |
15 | 56e293701 |
hex | 342874909 |
14001064201 has 4 divisors (see below), whose sum is σ = 14298959232. Its totient is φ = 13703169172.
The previous prime is 14001064163. The next prime is 14001064237. The reversal of 14001064201 is 10246010041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14001064201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14001064271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148947445 + ... + 148947538.
It is an arithmetic number, because the mean of its divisors is an integer number (3574739808).
Almost surely, 214001064201 is an apocalyptic number.
It is an amenable number.
14001064201 is a deficient number, since it is larger than the sum of its proper divisors (297895031).
14001064201 is an equidigital number, since it uses as much as digits as its factorization.
14001064201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297895030.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 14001064201 its reverse (10246010041), we get a palindrome (24247074242).
It can be divided in two parts, 1400 and 1064201, that added together give a palindrome (1065601).
The spelling of 14001064201 in words is "fourteen billion, one million, sixty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •