Base | Representation |
---|---|
bin | 10000000100010011101… |
… | …001111111100110101100 |
3 | 10220112222011101011111000 |
4 | 100010103221333212230 |
5 | 121042232402324404 |
6 | 2203122214200300 |
7 | 142525346204031 |
oct | 20042351774654 |
9 | 3815864334430 |
10 | 1104136370604 |
11 | 3962972184a3 |
12 | 159ba5053090 |
13 | 80172a36047 |
14 | 3b624999388 |
15 | 1dac3bb2339 |
hex | 10113a7f9ac |
1104136370604 has 96 divisors (see below), whose sum is σ = 2899685779200. Its totient is φ = 363288309120.
The previous prime is 1104136370593. The next prime is 1104136370629. The reversal of 1104136370604 is 4060736314011.
1104136370604 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 13 + 6 + 37 + 0 + 604 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5544399 + ... + 5740089.
It is an arithmetic number, because the mean of its divisors is an integer number (30205060200).
Almost surely, 21104136370604 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1104136370604, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1449842889600).
1104136370604 is an abundant number, since it is smaller than the sum of its proper divisors (1795549408596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104136370604 is a wasteful number, since it uses less digits than its factorization.
1104136370604 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196380 (or 196372 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The spelling of 1104136370604 in words is "one trillion, one hundred four billion, one hundred thirty-six million, three hundred seventy thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •