Base | Representation |
---|---|
bin | 10000001010110100100… |
… | …001110000111000010100 |
3 | 10221020000120201012201101 |
4 | 100022310201300320110 |
5 | 121201043324442322 |
6 | 2210240214435444 |
7 | 143163562551244 |
oct | 20126441607024 |
9 | 3836016635641 |
10 | 1111130312212 |
11 | 399256104328 |
12 | 15b417362b84 |
13 | 80a189ca52b |
14 | 3bac97b9b24 |
15 | 1dd82bd1327 |
hex | 102b4870e14 |
1111130312212 has 12 divisors (see below), whose sum is σ = 2046818996320. Its totient is φ = 526324884696.
The previous prime is 1111130312191. The next prime is 1111130312233. The reversal of 1111130312212 is 2122130311111.
It is an interprime number because it is at equal distance from previous prime (1111130312191) and next prime (1111130312233).
It is a super-3 number, since 3×11111303122123 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 1111130312212.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7310067768 + ... + 7310067919.
Almost surely, 21111130312212 is an apocalyptic number.
It is an amenable number.
1111130312212 is a deficient number, since it is larger than the sum of its proper divisors (935688684108).
1111130312212 is a wasteful number, since it uses less digits than its factorization.
1111130312212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14620135710 (or 14620135708 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1111130312212 its reverse (2122130311111), we get a palindrome (3233260623323).
The spelling of 1111130312212 in words is "one trillion, one hundred eleven billion, one hundred thirty million, three hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •