Base | Representation |
---|---|
bin | 110000101100011000… |
… | …1110000100110011101 |
3 | 100222220120101000122220 |
4 | 1201120301300212131 |
5 | 3203124033413422 |
6 | 120012125055553 |
7 | 10361210616105 |
oct | 1413061604635 |
9 | 328816330586 |
10 | 104568654237 |
11 | 40390308703 |
12 | 183239b75b9 |
13 | 9b261a3348 |
14 | 50bdb1c205 |
15 | 2ac0389e5c |
hex | 1858c7099d |
104568654237 has 12 divisors (see below), whose sum is σ = 141394984416. Its totient is φ = 68727468880.
The previous prime is 104568654217. The next prime is 104568654257. The reversal of 104568654237 is 732456865401.
It is an interprime number because it is at equal distance from previous prime (104568654217) and next prime (104568654257).
It is not a de Polignac number, because 104568654237 - 211 = 104568652189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104568654237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104568654217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4708363 + ... + 4730519.
It is an arithmetic number, because the mean of its divisors is an integer number (11782915368).
Almost surely, 2104568654237 is an apocalyptic number.
It is an amenable number.
104568654237 is a deficient number, since it is larger than the sum of its proper divisors (36826330179).
104568654237 is an frugal number, since it uses more digits than its factorization.
104568654237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44388 (or 22231 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 51.
The spelling of 104568654237 in words is "one hundred four billion, five hundred sixty-eight million, six hundred fifty-four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •