Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …110101100010011000101 |
3 | 10220021010202121011020121 |
4 | 100001132312230103011 |
5 | 121020024333221201 |
6 | 2201501215101541 |
7 | 142360234161631 |
oct | 20013666542305 |
9 | 3807122534217 |
10 | 1101103023301 |
11 | 394a7aa507a6 |
12 | 1594992118b1 |
13 | 7caab477098 |
14 | 3b417b91dc1 |
15 | 1d9977329a1 |
hex | 1005edac4c5 |
1101103023301 has 4 divisors (see below), whose sum is σ = 1139072093100. Its totient is φ = 1063133953504.
The previous prime is 1101103023299. The next prime is 1101103023323. The reversal of 1101103023301 is 1033203011011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 202455902401 + 898647120900 = 449951^2 + 947970^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101103023301 - 21 = 1101103023299 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 (1101103023001) 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, 18984534856 + ... + 18984534913.
It is an arithmetic number, because the mean of its divisors is an integer number (284768023275).
Almost surely, 21101103023301 is an apocalyptic number.
It is an amenable number.
1101103023301 is a deficient number, since it is larger than the sum of its proper divisors (37969069799).
1101103023301 is an equidigital number, since it uses as much as digits as its factorization.
1101103023301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37969069798.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1101103023301 its reverse (1033203011011), we get a palindrome (2134306034312).
The spelling of 1101103023301 in words is "one trillion, one hundred one billion, one hundred three million, twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •