Base | Representation |
---|---|
bin | 10000000111100010010… |
… | …111001111000101101100 |
3 | 10220212220211222010001000 |
4 | 100013202113033011230 |
5 | 121121333202241004 |
6 | 2204454300520300 |
7 | 143010316345164 |
oct | 20074227170554 |
9 | 3825824863030 |
10 | 1107604337004 |
11 | 397806855a30 |
12 | 15a7b2550090 |
13 | 805a6367b79 |
14 | 3b8733b95a4 |
15 | 1dc28392c39 |
hex | 101e25cf16c |
1107604337004 has 48 divisors (see below), whose sum is σ = 3132618330240. Its totient is φ = 335637677520.
The previous prime is 1107604336999. The next prime is 1107604337027. The reversal of 1107604337004 is 4007334067011.
1107604337004 is a `hidden beast` number, since 1 + 10 + 7 + 604 + 3 + 37 + 0 + 0 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1107604337004.
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 15 ways as a sum of consecutive naturals, for example, 466162254 + ... + 466164629.
It is an arithmetic number, because the mean of its divisors is an integer number (65262881880).
Almost surely, 21107604337004 is an apocalyptic number.
It is an amenable number.
1107604337004 is an abundant number, since it is smaller than the sum of its proper divisors (2025013993236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107604337004 is a wasteful number, since it uses less digits than its factorization.
1107604337004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932326907 (or 932326899 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 36.
The spelling of 1107604337004 in words is "one trillion, one hundred seven billion, six hundred four million, three hundred thirty-seven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •