Base | Representation |
---|---|
bin | 110000110111100110… |
… | …1001101010111100110 |
3 | 101000212210102202122020 |
4 | 1201233031031113212 |
5 | 3204411401324320 |
6 | 120113330244010 |
7 | 10403430226410 |
oct | 1415715152746 |
9 | 330783382566 |
10 | 104944948710 |
11 | 40563762278 |
12 | 18409a26606 |
13 | 9b861349b4 |
14 | 5117ab19b0 |
15 | 2ae3419940 |
hex | 186f34d5e6 |
104944948710 has 64 divisors (see below), whose sum is σ = 287883707904. Its totient is φ = 23984524800.
The previous prime is 104944948627. The next prime is 104944948741. The reversal of 104944948710 is 17849449401.
It is a super-2 number, since 2×1049449487102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2060350 + ... + 2110670.
It is an arithmetic number, because the mean of its divisors is an integer number (4498182936).
Almost surely, 2104944948710 is an apocalyptic number.
104944948710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104944948710 is an abundant number, since it is smaller than the sum of its proper divisors (182938759194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104944948710 is a wasteful number, since it uses less digits than its factorization.
104944948710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60269.
The product of its (nonzero) digits is 1161216, while the sum is 51.
The spelling of 104944948710 in words is "one hundred four billion, nine hundred forty-four million, nine hundred forty-eight thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •