Base | Representation |
---|---|
bin | 111011111100001111… |
… | …010111100000110101 |
3 | 20011010110101100122022 |
4 | 323330033113200311 |
5 | 2023303011212140 |
6 | 45322304442525 |
7 | 4435636056164 |
oct | 737417274065 |
9 | 204113340568 |
10 | 64361429045 |
11 | 25328392281 |
12 | 10582619445 |
13 | 60b9206c34 |
14 | 3187c0b3db |
15 | 1a1a5bd0b5 |
hex | efc3d7835 |
64361429045 has 8 divisors (see below), whose sum is σ = 77289649080. Its totient is φ = 51451853760.
The previous prime is 64361428993. The next prime is 64361429047. The reversal of 64361429045 is 54092416346.
It can be written as a sum of positive squares in 4 ways, for example, as 1678295089 + 62683133956 = 40967^2 + 250366^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 64361429045 - 224 = 64344651829 is a prime.
It is a super-2 number, since 2×643614290452 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64361428987 and 64361429005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64361429047) 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, 4653590 + ... + 4667399.
It is an arithmetic number, because the mean of its divisors is an integer number (9661206135).
Almost surely, 264361429045 is an apocalyptic number.
It is an amenable number.
64361429045 is a deficient number, since it is larger than the sum of its proper divisors (12928220035).
64361429045 is a wasteful number, since it uses less digits than its factorization.
64361429045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9322375.
The product of its (nonzero) digits is 622080, while the sum is 44.
The spelling of 64361429045 in words is "sixty-four billion, three hundred sixty-one million, four hundred twenty-nine thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •