Base | Representation |
---|---|
bin | 10001110000101011101… |
… | …111010011100000100111 |
3 | 11022200100001121022102202 |
4 | 101300223233103200213 |
5 | 124444043130024111 |
6 | 2332405251525115 |
7 | 154115145233510 |
oct | 21605357234047 |
9 | 4280301538382 |
10 | 1220504533031 |
11 | 430681a99263 |
12 | 1786605b979b |
13 | 8b129673aa4 |
14 | 43103825a07 |
15 | 21b34db7b3b |
hex | 11c2bbd3827 |
1220504533031 has 32 divisors (see below), whose sum is σ = 1438072704000. Its totient is φ = 1014286724352.
The previous prime is 1220504533021. The next prime is 1220504533043. The reversal of 1220504533031 is 1303354050221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1220504533031 - 210 = 1220504532007 is a prime.
It is a super-2 number, since 2×12205045330312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220504532985 and 1220504533003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220504533021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14550710 + ... + 14634348.
It is an arithmetic number, because the mean of its divisors is an integer number (44939772000).
Almost surely, 21220504533031 is an apocalyptic number.
1220504533031 is a deficient number, since it is larger than the sum of its proper divisors (217568170969).
1220504533031 is an equidigital number, since it uses as much as digits as its factorization.
1220504533031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84191.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 1220504533031 its reverse (1303354050221), we get a palindrome (2523858583252).
The spelling of 1220504533031 in words is "one trillion, two hundred twenty billion, five hundred four million, five hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •