Base | Representation |
---|---|
bin | 110000100111011011… |
… | …0110010011101011101 |
3 | 100222110222011021221110 |
4 | 1201032312302131131 |
5 | 3202303430403123 |
6 | 115543421252233 |
7 | 10354120030020 |
oct | 1411666623535 |
9 | 328428137843 |
10 | 104402200413 |
11 | 40305358465 |
12 | 18298104079 |
13 | 9aca863164 |
14 | 50a598d1b7 |
15 | 2ab095a493 |
hex | 184edb275d |
104402200413 has 32 divisors (see below), whose sum is σ = 160381312000. Its totient is φ = 59174603136.
The previous prime is 104402200403. The next prime is 104402200423. The reversal of 104402200413 is 314002204401.
It is an interprime number because it is at equal distance from previous prime (104402200403) and next prime (104402200423).
It is not a de Polignac number, because 104402200413 - 25 = 104402200381 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 104402200413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104402200403) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3262113 + ... + 3293961.
It is an arithmetic number, because the mean of its divisors is an integer number (5011916000).
Almost surely, 2104402200413 is an apocalyptic number.
It is an amenable number.
104402200413 is a deficient number, since it is larger than the sum of its proper divisors (55979111587).
104402200413 is a wasteful number, since it uses less digits than its factorization.
104402200413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33121.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 104402200413 its reverse (314002204401), we get a palindrome (418404404814).
The spelling of 104402200413 in words is "one hundred four billion, four hundred two million, two hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •