Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …001101111111001010101 |
3 | 10221022021222002110220112 |
4 | 100023221001233321111 |
5 | 121204344321041041 |
6 | 2210503441212405 |
7 | 143224446331565 |
oct | 20135101577125 |
9 | 3838258073815 |
10 | 1112011112021 |
11 | 399668312257 |
12 | 15b622331105 |
13 | 80b29330854 |
14 | 3bb70778da5 |
15 | 1ddd51b8deb |
hex | 102e906fe55 |
1112011112021 has 8 divisors (see below), whose sum is σ = 1134234603744. Its totient is φ = 1089916452720.
The previous prime is 1112011111997. The next prime is 1112011112039. The reversal of 1112011112021 is 1202111102111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1112011112021 - 222 = 1112006917717 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1112011111987 and 1112011112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112011112071) 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, 32190671 + ... + 32225196.
It is an arithmetic number, because the mean of its divisors is an integer number (141779325468).
Almost surely, 21112011112021 is an apocalyptic number.
It is an amenable number.
1112011112021 is a deficient number, since it is larger than the sum of its proper divisors (22223491723).
1112011112021 is an equidigital number, since it uses as much as digits as its factorization.
1112011112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64416211.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1112011112021 its reverse (1202111102111), we get a palindrome (2314122214132).
The spelling of 1112011112021 in words is "one trillion, one hundred twelve billion, eleven million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •