Base | Representation |
---|---|
bin | 110000110100000100… |
… | …1101001011000100001 |
3 | 101000120112200201120101 |
4 | 1201220021221120201 |
5 | 3204141100334434 |
6 | 120053501142401 |
7 | 10400462115616 |
oct | 1415011513041 |
9 | 330515621511 |
10 | 104826574369 |
11 | 40502960940 |
12 | 1839625aa01 |
13 | 9b677599ca |
14 | 510609a50d |
15 | 2ad7d35b14 |
hex | 1868269621 |
104826574369 has 16 divisors (see below), whose sum is σ = 122115709440. Its totient is φ = 89042688000.
The previous prime is 104826574361. The next prime is 104826574387. The reversal of 104826574369 is 963475628401.
It is a cyclic number.
It is not a de Polignac number, because 104826574369 - 23 = 104826574361 is a prime.
It is a super-2 number, since 2×1048265743692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104826574361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5290272 + ... + 5310049.
It is an arithmetic number, because the mean of its divisors is an integer number (7632231840).
It is a 2-persistent number, because it is pandigital, and so is 2⋅104826574369 = 209653148738, but 3⋅104826574369 = 314479723107 is not.
Almost surely, 2104826574369 is an apocalyptic number.
It is an amenable number.
104826574369 is a deficient number, since it is larger than the sum of its proper divisors (17289135071).
104826574369 is a wasteful number, since it uses less digits than its factorization.
104826574369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10600392.
The product of its (nonzero) digits is 8709120, while the sum is 55.
It can be divided in two parts, 104826 and 574369, that added together give a triangular number (679195 = T1165).
The spelling of 104826574369 in words is "one hundred four billion, eight hundred twenty-six million, five hundred seventy-four thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •