Base | Representation |
---|---|
bin | 10110111010011001… |
… | …00110110110111101 |
3 | 1011202021111202111221 |
4 | 23131030212312331 |
5 | 200143024113341 |
6 | 5352341113341 |
7 | 613554545032 |
oct | 133514466675 |
9 | 34667452457 |
10 | 12301004221 |
11 | 52426615a0 |
12 | 24736b8851 |
13 | 121062472c |
14 | 8499b3389 |
15 | 4bedcbed1 |
hex | 2dd326dbd |
12301004221 has 16 divisors (see below), whose sum is σ = 13586429376. Its totient is φ = 11044000000.
The previous prime is 12301004179. The next prime is 12301004237. The reversal of 12301004221 is 12240010321.
It is a de Polignac number, because none of the positive numbers 2k-12301004221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12301004195 and 12301004204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12301004621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 431706 + ... + 459316.
It is an arithmetic number, because the mean of its divisors is an integer number (849151836).
Almost surely, 212301004221 is an apocalyptic number.
12301004221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12301004221 is a deficient number, since it is larger than the sum of its proper divisors (1285425155).
12301004221 is a wasteful number, since it uses less digits than its factorization.
12301004221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28124.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 12301004221 its reverse (12240010321), we get a palindrome (24541014542).
It can be divided in two parts, 1230100 and 4221, that added together give a palindrome (1234321).
The spelling of 12301004221 in words is "twelve billion, three hundred one million, four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •