Base | Representation |
---|---|
bin | 110000011011110011… |
… | …0110010011111111110 |
3 | 100221110210011200100022 |
4 | 1200313212302133332 |
5 | 3201004101132202 |
6 | 115441004532142 |
7 | 10341342343253 |
oct | 1406746623776 |
9 | 327423150308 |
10 | 104012130302 |
11 | 40125154a73 |
12 | 181a9551052 |
13 | 9a67aba542 |
14 | 5069c5142a |
15 | 2a8b5a8ea2 |
hex | 18379b27fe |
104012130302 has 8 divisors (see below), whose sum is σ = 165195736416. Its totient is φ = 48946884832.
The previous prime is 104012130281. The next prime is 104012130337. The reversal of 104012130302 is 203031210401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1040121303022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent 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, 1529590118 + ... + 1529590185.
It is an arithmetic number, because the mean of its divisors is an integer number (20649467052).
Almost surely, 2104012130302 is an apocalyptic number.
104012130302 is a deficient number, since it is larger than the sum of its proper divisors (61183606114).
104012130302 is a wasteful number, since it uses less digits than its factorization.
104012130302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3059180322.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 104012130302 its reverse (203031210401), we get a palindrome (307043340703).
The spelling of 104012130302 in words is "one hundred four billion, twelve million, one hundred thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •