Base | Representation |
---|---|
bin | 10111000110100110… |
… | …11000110111100101 |
3 | 1012000102021022011001 |
4 | 23203103120313211 |
5 | 200400240221341 |
6 | 5410440513301 |
7 | 616240354606 |
oct | 134323306745 |
9 | 35012238131 |
10 | 12403445221 |
11 | 529546aa82 |
12 | 24a1a7b831 |
13 | 12289112cb |
14 | 85943bdad |
15 | 4c8db4d31 |
hex | 2e34d8de5 |
12403445221 has 8 divisors (see below), whose sum is σ = 13044639744. Its totient is φ = 11770743600.
The previous prime is 12403445207. The next prime is 12403445227. The reversal of 12403445221 is 12254430421.
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 12403445221 - 29 = 12403444709 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12403445221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12403445227) 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 7 ways as a sum of consecutive naturals, for example, 2120230 + ... + 2126071.
It is an arithmetic number, because the mean of its divisors is an integer number (1630579968).
Almost surely, 212403445221 is an apocalyptic number.
It is an amenable number.
12403445221 is a deficient number, since it is larger than the sum of its proper divisors (641194523).
12403445221 is a wasteful number, since it uses less digits than its factorization.
12403445221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4246451.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 12403445221 its reverse (12254430421), we get a palindrome (24657875642).
The spelling of 12403445221 in words is "twelve billion, four hundred three million, four hundred forty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •