Base | Representation |
---|---|
bin | 10000001011101000111… |
… | …101100101010111101011 |
3 | 10221022021220001000101120 |
4 | 100023220331211113223 |
5 | 121204344031122311 |
6 | 2210503401550323 |
7 | 143224434134040 |
oct | 20135075452753 |
9 | 3838256030346 |
10 | 1112010020331 |
11 | 399667737031 |
12 | 15b621aa53a3 |
13 | 80b2903a992 |
14 | 3bb705731c7 |
15 | 1ddd5050706 |
hex | 102e8f655eb |
1112010020331 has 8 divisors (see below), whose sum is σ = 1694491459584. Its totient is φ = 635434297320.
The previous prime is 1112010020311. The next prime is 1112010020333. The reversal of 1112010020331 is 1330200102111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1112010020331 - 25 = 1112010020299 is a prime.
It is a super-2 number, since 2×11120100203312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1112010020331.
It is not an unprimeable number, because it can be changed into a prime (1112010020333) 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, 26476429035 + ... + 26476429076.
It is an arithmetic number, because the mean of its divisors is an integer number (211811432448).
Almost surely, 21112010020331 is an apocalyptic number.
1112010020331 is a deficient number, since it is larger than the sum of its proper divisors (582481439253).
1112010020331 is an equidigital number, since it uses as much as digits as its factorization.
1112010020331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52952858121.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1112010020331 its reverse (1330200102111), we get a palindrome (2442210122442).
The spelling of 1112010020331 in words is "one trillion, one hundred twelve billion, ten million, twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •