Base | Representation |
---|---|
bin | 1011000000011011100000… |
… | …0100010001011011110110 |
3 | 1120211221101221202212012121 |
4 | 2300012320010101123312 |
5 | 3041234404304004231 |
6 | 41423330451510154 |
7 | 2356225054140304 |
oct | 260067004213366 |
9 | 46757357685177 |
10 | 12102011000566 |
11 | 3946485790443 |
12 | 143554abb835a |
13 | 69a2a3a28796 |
14 | 2dba51b5d274 |
15 | 15ec03992311 |
hex | b01b81116f6 |
12102011000566 has 8 divisors (see below), whose sum is σ = 18162505799064. Its totient is φ = 6047842400880.
The previous prime is 12102011000531. The next prime is 12102011000609. The reversal of 12102011000566 is 66500011020121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×121020110005663 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12102011000566.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1581544920 + ... + 1581552571.
It is an arithmetic number, because the mean of its divisors is an integer number (2270313224883).
Almost surely, 212102011000566 is an apocalyptic number.
12102011000566 is a deficient number, since it is larger than the sum of its proper divisors (6060494798498).
12102011000566 is a wasteful number, since it uses less digits than its factorization.
12102011000566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3163099406.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 12102011000566 its reverse (66500011020121), we get a palindrome (78602022020687).
The spelling of 12102011000566 in words is "twelve trillion, one hundred two billion, eleven million, five hundred sixty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •