Base | Representation |
---|---|
bin | 11101001111011000101001… |
… | …01110001001100010011111 |
3 | 22102200001022200012210020210 |
4 | 32213230110232021202133 |
5 | 31411444010033433211 |
6 | 344431052412343503 |
7 | 16354354310534646 |
oct | 1647542456114237 |
9 | 272601280183223 |
10 | 64300303030431 |
11 | 19540672834246 |
12 | 72659b5474b93 |
13 | 29b56531c4a70 |
14 | 11c421913a35d |
15 | 7678e9b289a6 |
hex | 3a7b14b8989f |
64300303030431 has 8 divisors (see below), whose sum is σ = 92328640248880. Its totient is φ = 39569417249472.
The previous prime is 64300303030417. The next prime is 64300303030489. The reversal of 64300303030431 is 13403030300346.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 64300303030431 - 25 = 64300303030399 is a prime.
It is a super-2 number, since 2×643003030304312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64300303031431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 824362859326 + ... + 824362859403.
It is an arithmetic number, because the mean of its divisors is an integer number (11541080031110).
Almost surely, 264300303030431 is an apocalyptic number.
64300303030431 is a deficient number, since it is larger than the sum of its proper divisors (28028337218449).
64300303030431 is a wasteful number, since it uses less digits than its factorization.
64300303030431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1648725718745.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 64300303030431 its reverse (13403030300346), we get a palindrome (77703333330777).
The spelling of 64300303030431 in words is "sixty-four trillion, three hundred billion, three hundred three million, thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •