Base | Representation |
---|---|
bin | 10000000011100100011… |
… | …100110001111110001100 |
3 | 10220110220222002202111222 |
4 | 100003210130301332030 |
5 | 121034122130041430 |
6 | 2202511443102512 |
7 | 142466621316653 |
oct | 20034434617614 |
9 | 3813828082458 |
10 | 1103344377740 |
11 | 395a20156540 |
12 | 159a03971a38 |
13 | 80077927907 |
14 | 3b58b71619a |
15 | 1da793bc9e5 |
hex | 100e4731f8c |
1103344377740 has 24 divisors (see below), whose sum is σ = 2527661665872. Its totient is φ = 401216137280.
The previous prime is 1103344377739. The next prime is 1103344377743. The reversal of 1103344377740 is 477734433011.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a junction number, because it is equal to n+sod(n) for n = 1103344377691 and 1103344377700.
It is not an unprimeable number, because it can be changed into a prime (1103344377743) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2507600639 + ... + 2507601078.
It is an arithmetic number, because the mean of its divisors is an integer number (105319236078).
Almost surely, 21103344377740 is an apocalyptic number.
1103344377740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1103344377740 is an abundant number, since it is smaller than the sum of its proper divisors (1424317288132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103344377740 is a wasteful number, since it uses less digits than its factorization.
1103344377740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5015201737 (or 5015201735 counting only the distinct ones).
The product of its (nonzero) digits is 592704, while the sum is 44.
The spelling of 1103344377740 in words is "one trillion, one hundred three billion, three hundred forty-four million, three hundred seventy-seven thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •