Base | Representation |
---|---|
bin | 1011000001100110011011… |
… | …0001101001011011101111 |
3 | 1120220212022112011111012121 |
4 | 2300121212301221123233 |
5 | 3042102101213000421 |
6 | 41440454224213411 |
7 | 2360536324621114 |
oct | 260314661513357 |
9 | 46825275144177 |
10 | 12122122000111 |
11 | 3953a65934022 |
12 | 143942216a267 |
13 | 69c15a3c8706 |
14 | 2dc9dca9a90b |
15 | 1604ce336d41 |
hex | b0666c696ef |
12122122000111 has 4 divisors (see below), whose sum is σ = 12145389029424. Its totient is φ = 12098854970800.
The previous prime is 12122122000091. The next prime is 12122122000141. The reversal of 12122122000111 is 11100022122121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12122122000111 - 213 = 12122121991919 is a prime.
It is a super-2 number, since 2×121221220001112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122122000141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11633513875 + ... + 11633514916.
It is an arithmetic number, because the mean of its divisors is an integer number (3036347257356).
Almost surely, 212122122000111 is an apocalyptic number.
12122122000111 is a deficient number, since it is larger than the sum of its proper divisors (23267029313).
12122122000111 is an equidigital number, since it uses as much as digits as its factorization.
12122122000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23267029312.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12122122000111 its reverse (11100022122121), we get a palindrome (23222144122232).
The spelling of 12122122000111 in words is "twelve trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •