Base | Representation |
---|---|
bin | 10000001100110101110… |
… | …111010001101001001100 |
3 | 10221102121210202120001022 |
4 | 100030311313101221030 |
5 | 121220014323243200 |
6 | 2211235411133312 |
7 | 143301421444463 |
oct | 20146567215114 |
9 | 3842553676038 |
10 | 1113300212300 |
11 | 39a169a45391 |
12 | 15b921ba4238 |
13 | 80ca3420593 |
14 | 3bc53a5d9da |
15 | 1de5d454885 |
hex | 10335dd1a4c |
1113300212300 has 18 divisors (see below), whose sum is σ = 2415861460908. Its totient is φ = 445320084880.
The previous prime is 1113300212287. The next prime is 1113300212303. The reversal of 1113300212300 is 32120033111.
It is not an unprimeable number, because it can be changed into a prime (1113300212303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5566500962 + ... + 5566501161.
It is an arithmetic number, because the mean of its divisors is an integer number (134214525606).
Almost surely, 21113300212300 is an apocalyptic number.
1113300212300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113300212300 is an abundant number, since it is smaller than the sum of its proper divisors (1302561248608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113300212300 is a wasteful number, since it uses less digits than its factorization.
1113300212300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11133002137 (or 11133002130 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1113300212300 its reverse (32120033111), we get a palindrome (1145420245411).
The spelling of 1113300212300 in words is "one trillion, one hundred thirteen billion, three hundred million, two hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •