Base | Representation |
---|---|
bin | 1011000001100110000000… |
… | …1010010000010000111111 |
3 | 1120220212000210022121112212 |
4 | 2300121200022100100333 |
5 | 3042101334304310421 |
6 | 41440435221251035 |
7 | 2360533506334112 |
oct | 260314012202077 |
9 | 46825023277485 |
10 | 12122011010111 |
11 | 3953a09216652 |
12 | 14393b0b63a7b |
13 | 69c140407862 |
14 | 2dc9cc048579 |
15 | 1604c4710e5b |
hex | b066029043f |
12122011010111 has 8 divisors (see below), whose sum is σ = 13277659119120. Its totient is φ = 11015539416448.
The previous prime is 12122011010093. The next prime is 12122011010203. The reversal of 12122011010111 is 11101011022121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12122011010111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122011010411) 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 7 ways as a sum of consecutive naturals, for example, 12294128321 + ... + 12294129306.
It is an arithmetic number, because the mean of its divisors is an integer number (1659707389890).
Almost surely, 212122011010111 is an apocalyptic number.
12122011010111 is a deficient number, since it is larger than the sum of its proper divisors (1155648109009).
12122011010111 is a wasteful number, since it uses less digits than its factorization.
12122011010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24588257673.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12122011010111 its reverse (11101011022121), we get a palindrome (23223022032232).
The spelling of 12122011010111 in words is "twelve trillion, one hundred twenty-two billion, eleven million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •