Base | Representation |
---|---|
bin | 110000100110010111… |
… | …1011110111101111010 |
3 | 100222101111102021020022 |
4 | 1201030233132331322 |
5 | 3202220340344010 |
6 | 115540113130442 |
7 | 10353206402024 |
oct | 1411457367572 |
9 | 328344367208 |
10 | 104366731130 |
11 | 40297331902 |
12 | 18288259a22 |
13 | 9ac33c490c |
14 | 50a0d99014 |
15 | 2aac7a0d55 |
hex | 184cbdef7a |
104366731130 has 8 divisors (see below), whose sum is σ = 187860116052. Its totient is φ = 41746692448.
The previous prime is 104366731129. The next prime is 104366731163. The reversal of 104366731130 is 31137663401.
It is a happy number.
104366731130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 89506877329 + 14859853801 = 299177^2 + 121901^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1043667311302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5218336547 + ... + 5218336566.
Almost surely, 2104366731130 is an apocalyptic number.
104366731130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104366731130 is a deficient number, since it is larger than the sum of its proper divisors (83493384922).
104366731130 is a wasteful number, since it uses less digits than its factorization.
104366731130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10436673120.
The product of its (nonzero) digits is 27216, while the sum is 35.
The spelling of 104366731130 in words is "one hundred four billion, three hundred sixty-six million, seven hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •