Base | Representation |
---|---|
bin | 11101111110111011111… |
… | …01010001100010111011 |
3 | 10122111011212120212010121 |
4 | 32333131331101202323 |
5 | 113334343034324011 |
6 | 2105135455354111 |
7 | 134300560052134 |
oct | 16773575214273 |
9 | 3574155525117 |
10 | 1030221011131 |
11 | 367a069a2954 |
12 | 1477b6b22937 |
13 | 761c3393650 |
14 | 37c11d82c8b |
15 | 1bbe9999e71 |
hex | efddf518bb |
1030221011131 has 16 divisors (see below), whose sum is σ = 1133043115680. Its totient is φ = 930978259200.
The previous prime is 1030221011129. The next prime is 1030221011161. The reversal of 1030221011131 is 1311101220301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1030221011131 - 21 = 1030221011129 is a prime.
It is a super-2 number, since 2×10302210111312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030221011161) 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, 4291185 + ... + 4524898.
It is an arithmetic number, because the mean of its divisors is an integer number (70815194730).
Almost surely, 21030221011131 is an apocalyptic number.
1030221011131 is a deficient number, since it is larger than the sum of its proper divisors (102822104549).
1030221011131 is a wasteful number, since it uses less digits than its factorization.
1030221011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8816286.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1030221011131 its reverse (1311101220301), we get a palindrome (2341322231432).
The spelling of 1030221011131 in words is "one trillion, thirty billion, two hundred twenty-one million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •