Base | Representation |
---|---|
bin | 10000001100100101001… |
… | …010011001001100100101 |
3 | 10221101220021111212112112 |
4 | 100030211022121030211 |
5 | 121213431110330201 |
6 | 2211151521330405 |
7 | 143261446666112 |
oct | 20144512311445 |
9 | 3841807455475 |
10 | 1113020011301 |
11 | 39a035864210 |
12 | 15b864196a05 |
13 | 80c5a365583 |
14 | 3bc28761909 |
15 | 1de43a570bb |
hex | 10325299325 |
1113020011301 has 8 divisors (see below), whose sum is σ = 1218082897344. Its totient is φ = 1008603666720.
The previous prime is 1113020011291. The next prime is 1113020011303. The reversal of 1113020011301 is 1031100203111.
It is a happy number.
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-1113020011301 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 (1113020011303) 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, 161631761 + ... + 161638646.
It is an arithmetic number, because the mean of its divisors is an integer number (152260362168).
Almost surely, 21113020011301 is an apocalyptic number.
1113020011301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1113020011301 is a deficient number, since it is larger than the sum of its proper divisors (105062886043).
1113020011301 is a wasteful number, since it uses less digits than its factorization.
1113020011301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323270731.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1113020011301 its reverse (1031100203111), we get a palindrome (2144120214412).
The spelling of 1113020011301 in words is "one trillion, one hundred thirteen billion, twenty million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •