Base | Representation |
---|---|
bin | 1010111011001000100000… |
… | …0011001111100001011101 |
3 | 1120112020112000102111110120 |
4 | 2232302020003033201131 |
5 | 3033242022321023010 |
6 | 41313440552225153 |
7 | 2346524023632654 |
oct | 256621003174135 |
9 | 46466460374416 |
10 | 12011011111005 |
11 | 3910928711545 |
12 | 141b99339b1b9 |
13 | 691830a0769a |
14 | 2d749c14219b |
15 | 15c679956e70 |
hex | aec880cf85d |
12011011111005 has 16 divisors (see below), whose sum is σ = 19251752103360. Its totient is φ = 6394494483968.
The previous prime is 12011011110997. The next prime is 12011011111027. The reversal of 12011011111005 is 50011111011021.
It is a cyclic number.
It is not a de Polignac number, because 12011011111005 - 23 = 12011011110997 is a prime.
It is a super-2 number, since 2×120110111110052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 711123060 + ... + 711139949.
It is an arithmetic number, because the mean of its divisors is an integer number (1203234506460).
Almost surely, 212011011111005 is an apocalyptic number.
12011011111005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12011011111005 is a deficient number, since it is larger than the sum of its proper divisors (7240740992355).
12011011111005 is a wasteful number, since it uses less digits than its factorization.
12011011111005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1422263580.
The product of its (nonzero) digits is 10, while the sum is 15.
Adding to 12011011111005 its reverse (50011111011021), we get a palindrome (62022122122026).
The spelling of 12011011111005 in words is "twelve trillion, eleven billion, eleven million, one hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •