Base | Representation |
---|---|
bin | 110000100010001110… |
… | …0011101011110001000 |
3 | 100222000210110221102121 |
4 | 1201010130131132020 |
5 | 3201424221322121 |
6 | 115514221341024 |
7 | 10346566233520 |
oct | 1410434353610 |
9 | 328023427377 |
10 | 104227526536 |
11 | 402257a3391 |
12 | 18249707774 |
13 | 9aa0605633 |
14 | 508a6c0680 |
15 | 2aa0455141 |
hex | 184471d788 |
104227526536 has 32 divisors (see below), whose sum is σ = 227006095680. Its totient is φ = 43936660800.
The previous prime is 104227526519. The next prime is 104227526537. The reversal of 104227526536 is 635625722401.
104227526536 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 104227526492 and 104227526501.
It is not an unprimeable number, because it can be changed into a prime (104227526537) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15252370 + ... + 15259201.
It is an arithmetic number, because the mean of its divisors is an integer number (7093940490).
Almost surely, 2104227526536 is an apocalyptic number.
It is an amenable number.
104227526536 is an abundant number, since it is smaller than the sum of its proper divisors (122778569144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104227526536 is a wasteful number, since it uses less digits than its factorization.
104227526536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30511645 (or 30511641 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 43.
The spelling of 104227526536 in words is "one hundred four billion, two hundred twenty-seven million, five hundred twenty-six thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •