Base | Representation |
---|---|
bin | 11101111110111011111… |
… | …01100111101110111011 |
3 | 10122111011212202110210112 |
4 | 32333131331213232323 |
5 | 113334343100231021 |
6 | 2105135501334535 |
7 | 134300560611113 |
oct | 16773575475673 |
9 | 3574155673715 |
10 | 1030221102011 |
11 | 367a06a55162 |
12 | 1477b6b6744b |
13 | 761c33c5b1a |
14 | 37c11da8043 |
15 | 1bbe99b6d5b |
hex | efddf67bbb |
1030221102011 has 4 divisors (see below), whose sum is σ = 1032611406624. Its totient is φ = 1027830797400.
The previous prime is 1030221101993. The next prime is 1030221102041. The reversal of 1030221102011 is 1102011220301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030221102011 is a prime.
It is a super-2 number, since 2×10302211020112 (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 (1030221102041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1195151660 + ... + 1195152521.
It is an arithmetic number, because the mean of its divisors is an integer number (258152851656).
Almost surely, 21030221102011 is an apocalyptic number.
1030221102011 is a deficient number, since it is larger than the sum of its proper divisors (2390304613).
1030221102011 is an equidigital number, since it uses as much as digits as its factorization.
1030221102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390304612.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1030221102011 its reverse (1102011220301), we get a palindrome (2132232322312).
The spelling of 1030221102011 in words is "one trillion, thirty billion, two hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.623 sec. • engine limits •