Base | Representation |
---|---|
bin | 10000001001111001000… |
… | …001100011010001000111 |
3 | 10221010110000020022102021 |
4 | 100021321001203101013 |
5 | 121142022243341403 |
6 | 2205553153424011 |
7 | 143130051260302 |
oct | 20117101432107 |
9 | 3833400208367 |
10 | 1110132012103 |
11 | 398893641714 |
12 | 15b198b6b007 |
13 | 808b9c36cca |
14 | 3ba32d91b39 |
15 | 1dd252388bd |
hex | 10279063447 |
1110132012103 has 8 divisors (see below), whose sum is σ = 1186001208320. Its totient is φ = 1036006935480.
The previous prime is 1110132012097. The next prime is 1110132012109. The reversal of 1110132012103 is 3012102310111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1110132012097) and next prime (1110132012109).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1110132012103 - 233 = 1101542077511 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110132012109) 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, 436028583 + ... + 436031128.
It is an arithmetic number, because the mean of its divisors is an integer number (148250151040).
Almost surely, 21110132012103 is an apocalyptic number.
1110132012103 is a deficient number, since it is larger than the sum of its proper divisors (75869196217).
1110132012103 is an equidigital number, since it uses as much as digits as its factorization.
1110132012103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 872059797.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1110132012103 its reverse (3012102310111), we get a palindrome (4122234322214).
The spelling of 1110132012103 in words is "one trillion, one hundred ten billion, one hundred thirty-two million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •