Base | Representation |
---|---|
bin | 10110110000000100… |
… | …10100001010000111 |
3 | 1011112020120211102202 |
4 | 23120002110022013 |
5 | 200003342420403 |
6 | 5340005225115 |
7 | 611453600144 |
oct | 133002241207 |
9 | 34466524382 |
10 | 12214420103 |
11 | 51a87a3676 |
12 | 244a70219b |
13 | 11c86ca522 |
14 | 83c2b53cb |
15 | 4b74c7688 |
hex | 2d8094287 |
12214420103 has 8 divisors (see below), whose sum is σ = 12240930240. Its totient is φ = 12187929600.
The previous prime is 12214420073. The next prime is 12214420133. The reversal of 12214420103 is 30102441221.
It is an interprime number because it is at equal distance from previous prime (12214420073) and next prime (12214420133).
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 12214420103 - 212 = 12214416007 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 (12214420133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2421458 + ... + 2426496.
It is an arithmetic number, because the mean of its divisors is an integer number (1530116280).
Almost surely, 212214420103 is an apocalyptic number.
12214420103 is a deficient number, since it is larger than the sum of its proper divisors (26510137).
12214420103 is an equidigital number, since it uses as much as digits as its factorization.
12214420103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9817.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12214420103 its reverse (30102441221), we get a palindrome (42316861324).
The spelling of 12214420103 in words is "twelve billion, two hundred fourteen million, four hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •