Base | Representation |
---|---|
bin | 110000011100011011… |
… | …1100110010101010010 |
3 | 100221112021000221002112 |
4 | 1200320313212111102 |
5 | 3201030012023010 |
6 | 115443042545322 |
7 | 10342020402554 |
oct | 1407067462522 |
9 | 327467027075 |
10 | 104033314130 |
11 | 40136103769 |
12 | 181b4668242 |
13 | 9a6c2c6755 |
14 | 506c9a74d4 |
15 | 2a8d390a05 |
hex | 1838de6552 |
104033314130 has 8 divisors (see below), whose sum is σ = 187259965452. Its totient is φ = 41613325648.
The previous prime is 104033314117. The next prime is 104033314139. The reversal of 104033314130 is 31413330401.
104033314130 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 84901721641 + 19131592489 = 291379^2 + 138317^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 104033314096 and 104033314105.
It is not an unprimeable number, because it can be changed into a prime (104033314139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5201665697 + ... + 5201665716.
Almost surely, 2104033314130 is an apocalyptic number.
104033314130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104033314130 is a deficient number, since it is larger than the sum of its proper divisors (83226651322).
104033314130 is a wasteful number, since it uses less digits than its factorization.
104033314130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10403331420.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 104033314130 its reverse (31413330401), we get a palindrome (135446644531).
The spelling of 104033314130 in words is "one hundred four billion, thirty-three million, three hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •