Base | Representation |
---|---|
bin | 110000100111110100… |
… | …0111101001001110101 |
3 | 100222111212220102201112 |
4 | 1201033220331021311 |
5 | 3202320312221123 |
6 | 115545011204405 |
7 | 10354336562102 |
oct | 1411750751165 |
9 | 328455812645 |
10 | 104415351413 |
11 | 4031181aa5a |
12 | 182a05a6705 |
13 | 9b004b9009 |
14 | 50a7613aa9 |
15 | 2ab1ba6d78 |
hex | 184fa3d275 |
104415351413 has 2 divisors, whose sum is σ = 104415351414. Its totient is φ = 104415351412.
The previous prime is 104415351389. The next prime is 104415351419. The reversal of 104415351413 is 314153514401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98861822929 + 5553528484 = 314423^2 + 74522^2 .
It is a cyclic number.
It is not a de Polignac number, because 104415351413 - 218 = 104415089269 is a prime.
It is a super-2 number, since 2×1044153514132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104415351413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104415351419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52207675706 + 52207675707.
It is an arithmetic number, because the mean of its divisors is an integer number (52207675707).
Almost surely, 2104415351413 is an apocalyptic number.
It is an amenable number.
104415351413 is a deficient number, since it is larger than the sum of its proper divisors (1).
104415351413 is an equidigital number, since it uses as much as digits as its factorization.
104415351413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 104415351413 its reverse (314153514401), we get a palindrome (418568865814).
The spelling of 104415351413 in words is "one hundred four billion, four hundred fifteen million, three hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •