Base | Representation |
---|---|
bin | 110000101000100110… |
… | …0110010111111110100 |
3 | 100222120201011011001110 |
4 | 1201101030302333310 |
5 | 3202344012233322 |
6 | 115551344155020 |
7 | 10355105210454 |
oct | 1412114627764 |
9 | 328521134043 |
10 | 104441524212 |
11 | 40325576a73 |
12 | 182a9308a70 |
13 | 9b05a50c8c |
14 | 50aaca7d64 |
15 | 2ab4126c0c |
hex | 1851332ff4 |
104441524212 has 48 divisors (see below), whose sum is σ = 244254169152. Its totient is φ = 34734297600.
The previous prime is 104441524199. The next prime is 104441524261. The reversal of 104441524212 is 212425144401.
It is a self number, because there is not a number n which added to its sum of digits gives 104441524212.
It is a congruent number.
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, 25001868 + ... + 25006044.
It is an arithmetic number, because the mean of its divisors is an integer number (5088628524).
Almost surely, 2104441524212 is an apocalyptic number.
104441524212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104441524212 is an abundant number, since it is smaller than the sum of its proper divisors (139812644940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104441524212 is a wasteful number, since it uses less digits than its factorization.
104441524212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8448 (or 8446 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 30.
Adding to 104441524212 its reverse (212425144401), we get a palindrome (316866668613).
The spelling of 104441524212 in words is "one hundred four billion, four hundred forty-one million, five hundred twenty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •