Base | Representation |
---|---|
bin | 1011000111011000010110… |
… | …0100111001101000101111 |
3 | 1121021100121222111221201102 |
4 | 2301312011210321220233 |
5 | 3100213433242000421 |
6 | 41554235541233315 |
7 | 2400653153321543 |
oct | 261660544715057 |
9 | 47240558457642 |
10 | 12221423000111 |
11 | 3992092743076 |
12 | 1454715a0283b |
13 | 6a8624158c90 |
14 | 30373cd63a23 |
15 | 162d91eea60b |
hex | b1d85939a2f |
12221423000111 has 8 divisors (see below), whose sum is σ = 13162216127760. Its totient is φ = 11280727539072.
The previous prime is 12221423000093. The next prime is 12221423000119. The reversal of 12221423000111 is 11100032412221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12221423000111 - 226 = 12221355891247 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 (12221423000119) 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, 24156650 + ... + 24657383.
It is an arithmetic number, because the mean of its divisors is an integer number (1645277015970).
Almost surely, 212221423000111 is an apocalyptic number.
12221423000111 is a deficient number, since it is larger than the sum of its proper divisors (940793127649).
12221423000111 is a wasteful number, since it uses less digits than its factorization.
12221423000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48833305.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12221423000111 its reverse (11100032412221), we get a palindrome (23321455412332).
The spelling of 12221423000111 in words is "twelve trillion, two hundred twenty-one billion, four hundred twenty-three million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •