Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …010111101100001101101 |
3 | 10220100110222110001011101 |
4 | 100002110322331201231 |
5 | 121023404042041414 |
6 | 2202131221123101 |
7 | 142421560253464 |
oct | 20022472754155 |
9 | 3810428401141 |
10 | 1102010112109 |
11 | 3953a5a84a75 |
12 | 1596b0b59491 |
13 | 7cbc438321a |
14 | 3b4a24359db |
15 | 1d9ec1aea74 |
hex | 10094ebd86d |
1102010112109 has 8 divisors (see below), whose sum is σ = 1128166605432. Its totient is φ = 1076152550400.
The previous prime is 1102010112103. The next prime is 1102010112139. The reversal of 1102010112109 is 9012110102011.
It can be written as a sum of positive squares in 4 ways, for example, as 541323648009 + 560686464100 = 735747^2 + 748790^2 .
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 1102010112109 - 221 = 1102008014957 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 (1102010112103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74725444 + ... + 74740189.
It is an arithmetic number, because the mean of its divisors is an integer number (141020825679).
Almost surely, 21102010112109 is an apocalyptic number.
It is an amenable number.
1102010112109 is a deficient number, since it is larger than the sum of its proper divisors (26156493323).
1102010112109 is a wasteful number, since it uses less digits than its factorization.
1102010112109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149465807.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 1102010112109 in words is "one trillion, one hundred two billion, ten million, one hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •