Base | Representation |
---|---|
bin | 11101111110111011110… |
… | …10101100000000111001 |
3 | 10122111011211022102001211 |
4 | 32333131322230000321 |
5 | 113334342401124423 |
6 | 2105135433043121 |
7 | 134300551226326 |
oct | 16773572540071 |
9 | 3574154272054 |
10 | 1030220333113 |
11 | 367a0657a504 |
12 | 1477b68564a1 |
13 | 761c31b6b5a |
14 | 37c11c47b4d |
15 | 1bbe98b410d |
hex | efddeac039 |
1030220333113 has 4 divisors (see below), whose sum is σ = 1030222397008. Its totient is φ = 1030218269220.
The previous prime is 1030220333111. The next prime is 1030220333209. The reversal of 1030220333113 is 3113330220301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1030220333113 - 21 = 1030220333111 is a prime.
It is a super-2 number, since 2×10302203331132 (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 (1030220333111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236578 + ... + 1454788.
It is an arithmetic number, because the mean of its divisors is an integer number (257555599252).
Almost surely, 21030220333113 is an apocalyptic number.
It is an amenable number.
1030220333113 is a deficient number, since it is larger than the sum of its proper divisors (2063895).
1030220333113 is an equidigital number, since it uses as much as digits as its factorization.
1030220333113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2063894.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1030220333113 its reverse (3113330220301), we get a palindrome (4143550553414).
The spelling of 1030220333113 in words is "one trillion, thirty billion, two hundred twenty million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •