Base | Representation |
---|---|
bin | 110000110000101110… |
… | …0011100000100100001 |
3 | 101000021200222101221221 |
4 | 1201201130130010201 |
5 | 3203423244410230 |
6 | 120034401415041 |
7 | 10364624552566 |
oct | 1414134340441 |
9 | 330250871857 |
10 | 104714060065 |
11 | 404553a220a |
12 | 1836463a481 |
13 | 9b4a3540b4 |
14 | 50d516c86d |
15 | 2acd00d27a |
hex | 186171c121 |
104714060065 has 8 divisors (see below), whose sum is σ = 128721674088. Its totient is φ = 81728046720.
The previous prime is 104714060063. The next prime is 104714060089. The reversal of 104714060065 is 560060417401.
It can be written as a sum of positive squares in 4 ways, for example, as 6595388944 + 98118671121 = 81212^2 + 313239^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104714060065 - 21 = 104714060063 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 104714060065.
It is not an unprimeable number, because it can be changed into a prime (104714060063) 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, 255399942 + ... + 255400351.
It is an arithmetic number, because the mean of its divisors is an integer number (16090209261).
Almost surely, 2104714060065 is an apocalyptic number.
It is an amenable number.
104714060065 is a deficient number, since it is larger than the sum of its proper divisors (24007614023).
104714060065 is an equidigital number, since it uses as much as digits as its factorization.
104714060065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510800339.
The product of its (nonzero) digits is 20160, while the sum is 34.
Adding to 104714060065 its reverse (560060417401), we get a palindrome (664774477466).
The spelling of 104714060065 in words is "one hundred four billion, seven hundred fourteen million, sixty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •