Base | Representation |
---|---|
bin | 110000110110010101… |
… | …1111010000011011010 |
3 | 101000202211212111111001 |
4 | 1201230223322003122 |
5 | 3204320040230120 |
6 | 120105220055214 |
7 | 10402404635515 |
oct | 1415453720332 |
9 | 330684774431 |
10 | 104902664410 |
11 | 40541901475 |
12 | 183b783450a |
13 | 9b7a44b4bb |
14 | 5112225d7c |
15 | 2ade865e0a |
hex | 186cafa0da |
104902664410 has 32 divisors (see below), whose sum is σ = 193783704192. Its totient is φ = 40872444480.
The previous prime is 104902664393. The next prime is 104902664437. The reversal of 104902664410 is 14466209401.
It is a super-2 number, since 2×1049026644102 (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 104902664410.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 771984 + ... + 897643.
It is an arithmetic number, because the mean of its divisors is an integer number (6055740756).
Almost surely, 2104902664410 is an apocalyptic number.
104902664410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104902664410 is a deficient number, since it is larger than the sum of its proper divisors (88881039782).
104902664410 is a wasteful number, since it uses less digits than its factorization.
104902664410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669798.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 104902664410 in words is "one hundred four billion, nine hundred two million, six hundred sixty-four thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •