Base | Representation |
---|---|
bin | 1011000001100011000001… |
… | …1011000001100110001111 |
3 | 1120220202221222021011120112 |
4 | 2300120300123001212033 |
5 | 3042043214241200421 |
6 | 41440223531110235 |
7 | 2360504612610410 |
oct | 260306033014617 |
9 | 46822858234515 |
10 | 12121210100111 |
11 | 3953638114062 |
12 | 14392088a237b |
13 | 69c0434c6708 |
14 | 2dc953923807 |
15 | 16047925945b |
hex | b06306c198f |
12121210100111 has 4 divisors (see below), whose sum is σ = 13852811542992. Its totient is φ = 10389608657232.
The previous prime is 12121210100057. The next prime is 12121210100203. The reversal of 12121210100111 is 11100101212121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 12121210100111 - 26 = 12121210100047 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 (12121210109111) by changing a digit.
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, 865800721430 + ... + 865800721443.
It is an arithmetic number, because the mean of its divisors is an integer number (3463202885748).
Almost surely, 212121210100111 is an apocalyptic number.
12121210100111 is a deficient number, since it is larger than the sum of its proper divisors (1731601442881).
12121210100111 is an equidigital number, since it uses as much as digits as its factorization.
12121210100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1731601442880.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12121210100111 its reverse (11100101212121), we get a palindrome (23221311312232).
The spelling of 12121210100111 in words is "twelve trillion, one hundred twenty-one billion, two hundred ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •