Base | Representation |
---|---|
bin | 10000000001011001100… |
… | …000011110001001110001 |
3 | 10220020220111210100122000 |
4 | 100001121200132021301 |
5 | 121014333401441423 |
6 | 2201444252204213 |
7 | 142355064511161 |
oct | 20013140361161 |
9 | 3806814710560 |
10 | 1101013312113 |
11 | 394a34347420 |
12 | 159473169669 |
13 | 7ca959c6740 |
14 | 3b409cbc5a1 |
15 | 1d98e911843 |
hex | 1005981e271 |
1101013312113 has 32 divisors (see below), whose sum is σ = 1916293572480. Its totient is φ = 615951501120.
The previous prime is 1101013312111. The next prime is 1101013312123. The reversal of 1101013312113 is 3112133101011.
1101013312113 is a `hidden beast` number, since 110 + 10 + 1 + 331 + 211 + 3 = 666.
It is not a de Polignac number, because 1101013312113 - 21 = 1101013312111 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1101013312111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 142577506 + ... + 142585227.
It is an arithmetic number, because the mean of its divisors is an integer number (59884174140).
Almost surely, 21101013312113 is an apocalyptic number.
1101013312113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1101013312113 is a deficient number, since it is larger than the sum of its proper divisors (815280260367).
1101013312113 is a wasteful number, since it uses less digits than its factorization.
1101013312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285162766 (or 285162760 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1101013312113 its reverse (3112133101011), we get a palindrome (4213146413124).
The spelling of 1101013312113 in words is "one trillion, one hundred one billion, thirteen million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •