Base | Representation |
---|---|
bin | 111011100111011100… |
… | …010100000110011001 |
3 | 20010020010210222220020 |
4 | 323213130110012121 |
5 | 2022044200021101 |
6 | 45223522021053 |
7 | 4424201166342 |
oct | 734734240631 |
9 | 203203728806 |
10 | 64012501401 |
11 | 2516942a822 |
12 | 104a57a7789 |
13 | 6061b37b84 |
14 | 315373d0c9 |
15 | 19e9b47136 |
hex | ee7714199 |
64012501401 has 8 divisors (see below), whose sum is σ = 85358493600. Its totient is φ = 42670755072.
The previous prime is 64012501391. The next prime is 64012501411. The reversal of 64012501401 is 10410521046.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (64012501391) and next prime (64012501411).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-64012501401 is a prime.
It is a super-2 number, since 2×640125014012 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (64012501411) 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, 1026120 + ... + 1086713.
It is an arithmetic number, because the mean of its divisors is an integer number (10669811700).
Almost surely, 264012501401 is an apocalyptic number.
It is an amenable number.
64012501401 is a deficient number, since it is larger than the sum of its proper divisors (21345992199).
64012501401 is a wasteful number, since it uses less digits than its factorization.
64012501401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2122935.
The product of its (nonzero) digits is 960, while the sum is 24.
The spelling of 64012501401 in words is "sixty-four billion, twelve million, five hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •