Base | Representation |
---|---|
bin | 1011000000010100000101… |
… | …1101110100101111111111 |
3 | 1120211202021021122000211211 |
4 | 2300011001131310233333 |
5 | 3041221320412210421 |
6 | 41422401211425251 |
7 | 2356124543200042 |
oct | 260050135645777 |
9 | 46752237560754 |
10 | 12100021210111 |
11 | 394565458741a |
12 | 1435094755227 |
13 | 69a047717493 |
14 | 2db9037a0c59 |
15 | 15eb38e499e1 |
hex | b0141774bff |
12100021210111 has 4 divisors (see below), whose sum is σ = 12265774925392. Its totient is φ = 11934267494832.
The previous prime is 12100021210103. The next prime is 12100021210201. The reversal of 12100021210111 is 11101212000121.
It is a happy number.
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 12100021210111 - 23 = 12100021210103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12100021210091 and 12100021210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100021210811) 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, 82876857531 + ... + 82876857676.
It is an arithmetic number, because the mean of its divisors is an integer number (3066443731348).
Almost surely, 212100021210111 is an apocalyptic number.
12100021210111 is a deficient number, since it is larger than the sum of its proper divisors (165753715281).
12100021210111 is an equidigital number, since it uses as much as digits as its factorization.
12100021210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165753715280.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12100021210111 its reverse (11101212000121), we get a palindrome (23201233210232).
The spelling of 12100021210111 in words is "twelve trillion, one hundred billion, twenty-one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •