Base | Representation |
---|---|
bin | 10001110000100111010… |
… | …110111111110101001001 |
3 | 11022200010221100002112222 |
4 | 101300213112333311021 |
5 | 124443420322131410 |
6 | 2332354104543425 |
7 | 154113263531426 |
oct | 21604726776511 |
9 | 4280127302488 |
10 | 1220431052105 |
11 | 43064456aa21 |
12 | 17863ba81b75 |
13 | 8b117386a55 |
14 | 430d7b78d4d |
15 | 21b2d700955 |
hex | 11c275bfd49 |
1220431052105 has 4 divisors (see below), whose sum is σ = 1464517262532. Its totient is φ = 976344841680.
The previous prime is 1220431052083. The next prime is 1220431052119. The reversal of 1220431052105 is 5012501340221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 412057434889 + 808373617216 = 641917^2 + 899096^2 .
It is not a de Polignac number, because 1220431052105 - 216 = 1220430986569 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 122043105206 + ... + 122043105215.
It is an arithmetic number, because the mean of its divisors is an integer number (366129315633).
Almost surely, 21220431052105 is an apocalyptic number.
It is an amenable number.
1220431052105 is a deficient number, since it is larger than the sum of its proper divisors (244086210427).
1220431052105 is an equidigital number, since it uses as much as digits as its factorization.
1220431052105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244086210426.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 1220431052105 its reverse (5012501340221), we get a palindrome (6232932392326).
The spelling of 1220431052105 in words is "one trillion, two hundred twenty billion, four hundred thirty-one million, fifty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •