Base | Representation |
---|---|
bin | 1011001000100001101001… |
… | …1011100000111101011111 |
3 | 1121100020102022122222211010 |
4 | 2302020122123200331133 |
5 | 3101024233123322421 |
6 | 42011252300230303 |
7 | 2402250606014436 |
oct | 262103233407537 |
9 | 47306368588733 |
10 | 12241100214111 |
11 | 399a46aa451aa |
12 | 14584a783b393 |
13 | 6aa43b9b8582 |
14 | 30468842411d |
15 | 163644756076 |
hex | b221a6e0f5f |
12241100214111 has 8 divisors (see below), whose sum is σ = 16323381078784. Its totient is φ = 8159776412760.
The previous prime is 12241100214107. The next prime is 12241100214113. The reversal of 12241100214111 is 11141200114221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12241100214111 - 22 = 12241100214107 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 (12241100214113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 239235985 + ... + 239287146.
It is an arithmetic number, because the mean of its divisors is an integer number (2040422634848).
Almost surely, 212241100214111 is an apocalyptic number.
12241100214111 is a deficient number, since it is larger than the sum of its proper divisors (4082280864673).
12241100214111 is an equidigital number, since it uses as much as digits as its factorization.
12241100214111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478531661.
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 12241100214111 its reverse (11141200114221), we get a palindrome (23382300328332).
The spelling of 12241100214111 in words is "twelve trillion, two hundred forty-one billion, one hundred million, two hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •