Base | Representation |
---|---|
bin | 111110101101000… |
… | …1010111111001010 |
3 | 12102122001220220000 |
4 | 1331122022333022 |
5 | 13302111401441 |
6 | 544440143430 |
7 | 103065545643 |
oct | 17532127712 |
9 | 5378056800 |
10 | 2104012746 |
11 | 98a729a10 |
12 | 4a8767b76 |
13 | 276b94474 |
14 | 15d6126ca |
15 | c4aab2b6 |
hex | 7d68afca |
2104012746 has 80 divisors (see below), whose sum is σ = 5182977888. Its totient is φ = 632642400.
The previous prime is 2104012739. The next prime is 2104012751. The reversal of 2104012746 is 6472104012.
2104012746 is a `hidden beast` number, since 210 + 401 + 2 + 7 + 46 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 39 ways as a sum of consecutive naturals, for example, 228936 + ... + 237948.
Almost surely, 22104012746 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2104012746, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2591488944).
2104012746 is an abundant number, since it is smaller than the sum of its proper divisors (3078965142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2104012746 is a wasteful number, since it uses less digits than its factorization.
2104012746 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9169 (or 9160 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 2104012746 is about 45869.5187025109. The cubic root of 2104012746 is about 1281.3943029824.
Adding to 2104012746 its reverse (6472104012), we get a palindrome (8576116758).
The spelling of 2104012746 in words is "two billion, one hundred four million, twelve thousand, seven hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •