Base | Representation |
---|---|
bin | 10000000101111101111… |
… | …110000000000000000011 |
3 | 10220201120110120221001010 |
4 | 100011331332000000003 |
5 | 121104411010000003 |
6 | 2204015211412003 |
7 | 142620504616530 |
oct | 20057576000003 |
9 | 3821513527033 |
10 | 1105920000003 |
11 | 397022010685 |
12 | 15a402454003 |
13 | 80398413960 |
14 | 3b75380dd87 |
15 | 1db7a585003 |
hex | 1017df80003 |
1105920000003 has 64 divisors (see below), whose sum is σ = 1900491651072. Its totient is φ = 555993123840.
The previous prime is 1105919999941. The next prime is 1105920000011. The reversal of 1105920000003 is 3000000295011.
It is not a de Polignac number, because 1105920000003 - 212 = 1105919995907 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1105920000013) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1451001 + ... + 2077797.
It is an arithmetic number, because the mean of its divisors is an integer number (29695182048).
Almost surely, 21105920000003 is an apocalyptic number.
1105920000003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1105920000003 is a deficient number, since it is larger than the sum of its proper divisors (794571651069).
1105920000003 is a wasteful number, since it uses less digits than its factorization.
1105920000003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627124.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 1105920000003 its reverse (3000000295011), we get a palindrome (4105920295014).
It can be divided in two parts, 110592000000 and 3, that multiplied together give a square (331776000000 = 5760002).
The spelling of 1105920000003 in words is "one trillion, one hundred five billion, nine hundred twenty million, three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •