Base | Representation |
---|---|
bin | 111011101101100100… |
… | …110111000110011101 |
3 | 20010111022110001101112 |
4 | 323231210313012131 |
5 | 2022302020431323 |
6 | 45242035351405 |
7 | 4426560644426 |
oct | 735544670635 |
9 | 203438401345 |
10 | 64115405213 |
11 | 252115249a2 |
12 | 10514152565 |
13 | 607a2572c2 |
14 | 316328864d |
15 | 1a03bc2178 |
hex | eed93719d |
64115405213 has 8 divisors (see below), whose sum is σ = 64420520832. Its totient is φ = 63810488896.
The previous prime is 64115405203. The next prime is 64115405219. The reversal of 64115405213 is 31250451146.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 64115405213 - 210 = 64115404189 is a prime.
It is a super-2 number, since 2×641154052132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 64115405213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64115405219) 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, 616181 + ... + 712677.
It is an arithmetic number, because the mean of its divisors is an integer number (8052565104).
Almost surely, 264115405213 is an apocalyptic number.
It is an amenable number.
64115405213 is a deficient number, since it is larger than the sum of its proper divisors (305115619).
64115405213 is a wasteful number, since it uses less digits than its factorization.
64115405213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99651.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 64115405213 its reverse (31250451146), we get a palindrome (95365856359).
The spelling of 64115405213 in words is "sixty-four billion, one hundred fifteen million, four hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •