Base | Representation |
---|---|
bin | 10000000010100000001… |
… | …111010111100101110011 |
3 | 10220100222012202220122012 |
4 | 100002200033113211303 |
5 | 121024301200323443 |
6 | 2202202123233135 |
7 | 142426354341101 |
oct | 20024017274563 |
9 | 3810865686565 |
10 | 1102200011123 |
11 | 395493198a02 |
12 | 1597446787ab |
13 | 7cc248119c3 |
14 | 3b4bd748c71 |
15 | 1da0dbc1118 |
hex | 100a03d7973 |
1102200011123 has 8 divisors (see below), whose sum is σ = 1102764535488. Its totient is φ = 1101635625024.
The previous prime is 1102200011117. The next prime is 1102200011131. The reversal of 1102200011123 is 3211100022011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102200011123 is a prime.
It is a super-2 number, since 2×11022000111232 (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 = 1102200011098 and 1102200011107.
It is not an unprimeable number, because it can be changed into a prime (1102200011023) 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, 18328661 + ... + 18388697.
It is an arithmetic number, because the mean of its divisors is an integer number (137845566936).
Almost surely, 21102200011123 is an apocalyptic number.
1102200011123 is a deficient number, since it is larger than the sum of its proper divisors (564524365).
1102200011123 is an equidigital number, since it uses as much as digits as its factorization.
1102200011123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69133.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1102200011123 its reverse (3211100022011), we get a palindrome (4313300033134).
The spelling of 1102200011123 in words is "one trillion, one hundred two billion, two hundred million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •