Base | Representation |
---|---|
bin | 10111110010111110010111… |
… | …011110011001000110001100 |
3 | 111201120012121121211120111220 |
4 | 113302332113132121012030 |
5 | 102204204100403201424 |
6 | 1010331120434243340 |
7 | 31021202016045300 |
oct | 2762762736310614 |
9 | 451505547746456 |
10 | 104658009428364 |
11 | 30390237991477 |
12 | b8a350b726550 |
13 | 4652291b03302 |
14 | 1bbb690765d00 |
15 | c175dd1eb579 |
hex | 5f2f9779918c |
104658009428364 has 72 divisors (see below), whose sum is σ = 284074954168320. Its totient is φ = 29901950061984.
The previous prime is 104658009428257. The next prime is 104658009428369. The reversal of 104658009428364 is 463824900856401.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 104658009428298 and 104658009428307.
It is not an unprimeable number, because it can be changed into a prime (104658009428369) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53511069 + ... + 55432395.
It is an arithmetic number, because the mean of its divisors is an integer number (3945485474560).
Almost surely, 2104658009428364 is an apocalyptic number.
104658009428364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
104658009428364 is an abundant number, since it is smaller than the sum of its proper divisors (179416944739956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104658009428364 is a wasteful number, since it uses less digits than its factorization.
104658009428364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2013987 (or 2013978 counting only the distinct ones).
The product of its (nonzero) digits is 39813120, while the sum is 60.
The spelling of 104658009428364 in words is "one hundred four trillion, six hundred fifty-eight billion, nine million, four hundred twenty-eight thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •