Base | Representation |
---|---|
bin | 10000000100001100010… |
… | …011110101101001011100 |
3 | 10220112122120110111101002 |
4 | 100010030103311221130 |
5 | 121042004324402030 |
6 | 2203102052405432 |
7 | 142522321463045 |
oct | 20041423655134 |
9 | 3815576414332 |
10 | 1104013122140 |
11 | 396233698065 |
12 | 159b6b916878 |
13 | 80153342666 |
14 | 3b6124758cc |
15 | 1dab7e69245 |
hex | 1010c4f5a5c |
1104013122140 has 24 divisors (see below), whose sum is σ = 2318870477952. Its totient is φ = 441520882880.
The previous prime is 1104013122127. The next prime is 1104013122209. The reversal of 1104013122140 is 412213104011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5165516 + ... + 5374995.
It is an arithmetic number, because the mean of its divisors is an integer number (96619603248).
Almost surely, 21104013122140 is an apocalyptic number.
1104013122140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1104013122140 is an abundant number, since it is smaller than the sum of its proper divisors (1214857355812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104013122140 is a wasteful number, since it uses less digits than its factorization.
1104013122140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10545757 (or 10545755 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1104013122140 its reverse (412213104011), we get a palindrome (1516226226151).
The spelling of 1104013122140 in words is "one trillion, one hundred four billion, thirteen million, one hundred twenty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •