Base | Representation |
---|---|
bin | 10000001001110011110… |
… | …001110110011110101000 |
3 | 10221010012212122100210020 |
4 | 100021303301312132220 |
5 | 121141332231313113 |
6 | 2205540331320440 |
7 | 143124632256504 |
oct | 20116361663650 |
9 | 3833185570706 |
10 | 1110044010408 |
11 | 3988489a5743 |
12 | 15b1735b0120 |
13 | 808a49347b8 |
14 | 3ba25405304 |
15 | 1dd1c654023 |
hex | 10273c767a8 |
1110044010408 has 16 divisors (see below), whose sum is σ = 2775110026080. Its totient is φ = 370014670128.
The previous prime is 1110044010407. The next prime is 1110044010461. The reversal of 1110044010408 is 8040104400111.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 46251833767 = 1110044010408 / (1 + 1 + 1 + 0 + 0 + 4 + 4 + 0 + 1 + 0 + 4 + 0 + 8).
It is not an unprimeable number, because it can be changed into a prime (1110044010407) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23125916860 + ... + 23125916907.
It is an arithmetic number, because the mean of its divisors is an integer number (173444376630).
Almost surely, 21110044010408 is an apocalyptic number.
It is an amenable number.
1110044010408 is an abundant number, since it is smaller than the sum of its proper divisors (1665066015672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110044010408 is a wasteful number, since it uses less digits than its factorization.
1110044010408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46251833776 (or 46251833772 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 1110044010408 its reverse (8040104400111), we get a palindrome (9150148410519).
The spelling of 1110044010408 in words is "one trillion, one hundred ten billion, forty-four million, ten thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •