Base | Representation |
---|---|
bin | 110000100001011110… |
… | …0101001100101001001 |
3 | 100221222001012220110010 |
4 | 1201002330221211021 |
5 | 3201401304112223 |
6 | 115511523142133 |
7 | 10346142605421 |
oct | 1410274514511 |
9 | 327861186403 |
10 | 104202410313 |
11 | 402125a9181 |
12 | 18241214949 |
13 | 9a98350571 |
14 | 5087223481 |
15 | 2a9d143393 |
hex | 1842f29949 |
104202410313 has 8 divisors (see below), whose sum is σ = 138938291008. Its totient is φ = 69467401584.
The previous prime is 104202410309. The next prime is 104202410369. The reversal of 104202410313 is 313014202401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104202410313 - 22 = 104202410309 is a prime.
It is a super-3 number, since 3×1042024103133 (a number of 34 digits) contains 333 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 104202410313.
It is not an unprimeable number, because it can be changed into a prime (104202410303) 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, 149220 + ... + 480282.
It is an arithmetic number, because the mean of its divisors is an integer number (17367286376).
Almost surely, 2104202410313 is an apocalyptic number.
It is an amenable number.
104202410313 is a deficient number, since it is larger than the sum of its proper divisors (34735880695).
104202410313 is a wasteful number, since it uses less digits than its factorization.
104202410313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 435983.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 104202410313 its reverse (313014202401), we get a palindrome (417216612714).
The spelling of 104202410313 in words is "one hundred four billion, two hundred two million, four hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •