Base | Representation |
---|---|
bin | 10000000100100100010… |
… | …011010111000010101100 |
3 | 10220120200121220000202000 |
4 | 100010210103113002230 |
5 | 121043320401244324 |
6 | 2203210032132300 |
7 | 142535310063414 |
oct | 20044423270254 |
9 | 3816617800660 |
10 | 1104415649964 |
11 | 39641a92a190 |
12 | 15a062697090 |
13 | 801b885a6c3 |
14 | 3b64dad7644 |
15 | 1dadd47b9c9 |
hex | 101244d70ac |
1104415649964 has 96 divisors (see below), whose sum is σ = 3139456320000. Its totient is φ = 332972498880.
The previous prime is 1104415649963. The next prime is 1104415649983. The reversal of 1104415649964 is 4699465144011.
It is a happy number.
1104415649964 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 41 + 56 + 499 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 1104415649964.
It is not an unprimeable number, because it can be changed into a prime (1104415649963) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2125464 + ... + 2593535.
It is an arithmetic number, because the mean of its divisors is an integer number (32702670000).
Almost surely, 21104415649964 is an apocalyptic number.
It is an amenable number.
1104415649964 is an abundant number, since it is smaller than the sum of its proper divisors (2035040670036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104415649964 is a wasteful number, since it uses less digits than its factorization.
1104415649964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4719220 (or 4719212 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 54.
The spelling of 1104415649964 in words is "one trillion, one hundred four billion, four hundred fifteen million, six hundred forty-nine thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •