Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100100011101000100111 |
3 | 10220011120000020002210220 |
4 | 100000203030203220213 |
5 | 121011002120401043 |
6 | 2201214022215423 |
7 | 142323361515252 |
oct | 20004314435047 |
9 | 3804500202726 |
10 | 1100102122023 |
11 | 394606a71863 |
12 | 159259b84573 |
13 | 7c97bcb28c8 |
14 | 3b360c8c099 |
15 | 1d939924483 |
hex | 10023323a27 |
1100102122023 has 4 divisors (see below), whose sum is σ = 1466802829368. Its totient is φ = 733401414680.
The previous prime is 1100102122003. The next prime is 1100102122039. The reversal of 1100102122023 is 3202212010011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1100102122023 - 29 = 1100102121511 is a prime.
It is a super-2 number, since 2×11001021220232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100102121993 and 1100102122011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100102122003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 183350353668 + ... + 183350353673.
It is an arithmetic number, because the mean of its divisors is an integer number (366700707342).
Almost surely, 21100102122023 is an apocalyptic number.
1100102122023 is a deficient number, since it is larger than the sum of its proper divisors (366700707345).
1100102122023 is an equidigital number, since it uses as much as digits as its factorization.
1100102122023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366700707344.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1100102122023 its reverse (3202212010011), we get a palindrome (4302314132034).
The spelling of 1100102122023 in words is "one trillion, one hundred billion, one hundred two million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •