Base | Representation |
---|---|
bin | 100100011001000… |
… | …1010100100001111 |
3 | 10011002201211001110 |
4 | 1020302022210033 |
5 | 10000101010111 |
6 | 321100343103 |
7 | 42155156361 |
oct | 11062124417 |
9 | 3132654043 |
10 | 1221110031 |
11 | 577315049 |
12 | 2a0b44a93 |
13 | 165ca5c1b |
14 | b8266d31 |
15 | 7230a5a6 |
hex | 48c8a90f |
1221110031 has 16 divisors (see below), whose sum is σ = 1735539200. Its totient is φ = 761462208.
The previous prime is 1221109973. The next prime is 1221110071. The reversal of 1221110031 is 1300111221.
It is not a de Polignac number, because 1221110031 - 211 = 1221107983 is a prime.
It is a super-2 number, since 2×12211100312 = 2982219415617641922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221109989 and 1221110016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221110071) 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 15 ways as a sum of consecutive naturals, for example, 131086 + ... + 140091.
It is an arithmetic number, because the mean of its divisors is an integer number (108471200).
Almost surely, 21221110031 is an apocalyptic number.
1221110031 is a deficient number, since it is larger than the sum of its proper divisors (514429169).
1221110031 is a wasteful number, since it uses less digits than its factorization.
1221110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271278.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1221110031 is about 34944.3848278947. The cubic root of 1221110031 is about 1068.8537032574.
Adding to 1221110031 its reverse (1300111221), we get a palindrome (2521221252).
The spelling of 1221110031 in words is "one billion, two hundred twenty-one million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •