Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …110101110111111000011 |
3 | 10220100111001022021211112 |
4 | 100002110332232333003 |
5 | 121023404320213443 |
6 | 2202131254233535 |
7 | 142421601543062 |
oct | 20022476567703 |
9 | 3810431267745 |
10 | 1102011101123 |
11 | 3953a65a0039 |
12 | 1596b13558ab |
13 | 7cbc463b43a |
14 | 3b4a26121d9 |
15 | 1d9ec307b18 |
hex | 10094faefc3 |
1102011101123 has 8 divisors (see below), whose sum is σ = 1173822324192. Its totient is φ = 1030976215936.
The previous prime is 1102011101117. The next prime is 1102011101141. The reversal of 1102011101123 is 3211011102011.
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 1102011101123 - 28 = 1102011100867 is a prime.
It is a super-2 number, since 2×11020111011232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102011101098 and 1102011101107.
It is not an unprimeable number, because it can be changed into a prime (1102011101143) 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, 194081540 + ... + 194087217.
It is an arithmetic number, because the mean of its divisors is an integer number (146727790524).
Almost surely, 21102011101123 is an apocalyptic number.
1102011101123 is a deficient number, since it is larger than the sum of its proper divisors (71811223069).
1102011101123 is a wasteful number, since it uses less digits than its factorization.
1102011101123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388168941.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1102011101123 its reverse (3211011102011), we get a palindrome (4313022203134).
The spelling of 1102011101123 in words is "one trillion, one hundred two billion, eleven million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •