Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …011110001001101011110 |
3 | 10221022022120212120111020 |
4 | 100023221203301031132 |
5 | 121204404111432202 |
6 | 2210504400305010 |
7 | 143224615204446 |
oct | 20135143611536 |
9 | 3838276776436 |
10 | 1112020030302 |
11 | 399672353735 |
12 | 15b625312166 |
13 | 80b2b133c3c |
14 | 3bb71a1b126 |
15 | 1ddd5d7b5bc |
hex | 102e98f135e |
1112020030302 has 8 divisors (see below), whose sum is σ = 2224040060616. Its totient is φ = 370673343432.
The previous prime is 1112020030279. The next prime is 1112020030307. The reversal of 1112020030302 is 2030300202111.
It is a sphenic number, since it is the product of 3 distinct primes.
1112020030302 is an admirable number.
It is a super-3 number, since 3×11120200303023 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112020030307) 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, 92668335853 + ... + 92668335864.
It is an arithmetic number, because the mean of its divisors is an integer number (278005007577).
Almost surely, 21112020030302 is an apocalyptic number.
1112020030302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112020030302 is a wasteful number, since it uses less digits than its factorization.
1112020030302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185336671722.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1112020030302 its reverse (2030300202111), we get a palindrome (3142320232413).
The spelling of 1112020030302 in words is "one trillion, one hundred twelve billion, twenty million, thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •