Base | Representation |
---|---|
bin | 10001110000100001011… |
… | …001110010111000110111 |
3 | 11022122212222022010112112 |
4 | 101300201121302320313 |
5 | 124443214231402411 |
6 | 2332340135041235 |
7 | 154110641250614 |
oct | 21604131627067 |
9 | 4278788263475 |
10 | 1220331122231 |
11 | 4305a3117151 |
12 | 17861251021b |
13 | 8b0cc769150 |
14 | 430c87a550b |
15 | 21b24a61b8b |
hex | 11c21672e37 |
1220331122231 has 16 divisors (see below), whose sum is σ = 1325692626048. Its totient is φ = 1116653580000.
The previous prime is 1220331122207. The next prime is 1220331122293. The reversal of 1220331122231 is 1322211330221.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220331122231 is a prime.
It is a super-2 number, since 2×12203311222312 (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 = 1220331122197 and 1220331122206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220331124231) 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, 197741 + ... + 1574726.
It is an arithmetic number, because the mean of its divisors is an integer number (82855789128).
Almost surely, 21220331122231 is an apocalyptic number.
1220331122231 is a deficient number, since it is larger than the sum of its proper divisors (105361503817).
1220331122231 is a wasteful number, since it uses less digits than its factorization.
1220331122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1772942.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1220331122231 its reverse (1322211330221), we get a palindrome (2542542452452).
The spelling of 1220331122231 in words is "one trillion, two hundred twenty billion, three hundred thirty-one million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •