Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …010001010110100011101 |
3 | 10221022021222022002011222 |
4 | 100023221002022310131 |
5 | 121204344333103201 |
6 | 2210503443423125 |
7 | 143224450301240 |
oct | 20135102126435 |
9 | 3838258262158 |
10 | 1112011222301 |
11 | 3996683880a1 |
12 | 15b622384aa5 |
13 | 80b2936bac5 |
14 | 3bb707a7257 |
15 | 1ddd51db91b |
hex | 102e908ad1d |
1112011222301 has 32 divisors (see below), whose sum is σ = 1307286190080. Its totient is φ = 926198267904.
The previous prime is 1112011222291. The next prime is 1112011222307. The reversal of 1112011222301 is 1032221102111.
It is a happy number.
It is not a de Polignac number, because 1112011222301 - 238 = 837133315357 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1112011222301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112011222307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 60317981 + ... + 60336413.
It is an arithmetic number, because the mean of its divisors is an integer number (40852693440).
Almost surely, 21112011222301 is an apocalyptic number.
It is an amenable number.
1112011222301 is a deficient number, since it is larger than the sum of its proper divisors (195274967779).
1112011222301 is a wasteful number, since it uses less digits than its factorization.
1112011222301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20045.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1112011222301 its reverse (1032221102111), we get a palindrome (2144232324412).
The spelling of 1112011222301 in words is "one trillion, one hundred twelve billion, eleven million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •