Base | Representation |
---|---|
bin | 11101011001101001010… |
… | …11000010011111110011 |
3 | 10120120111122102112112010 |
4 | 32230310223002133303 |
5 | 113022342424342321 |
6 | 2052025133334003 |
7 | 132661502632266 |
oct | 16546453023763 |
9 | 3516448375463 |
10 | 1010201012211 |
11 | 35a4731543a6 |
12 | 14394a337303 |
13 | 74352805c41 |
14 | 36c73172cdd |
15 | 1b4270cd676 |
hex | eb34ac27f3 |
1010201012211 has 4 divisors (see below), whose sum is σ = 1346934682952. Its totient is φ = 673467341472.
The previous prime is 1010201012189. The next prime is 1010201012281. The reversal of 1010201012211 is 1122101020101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1010201012211 - 26 = 1010201012147 is a prime.
It is a super-2 number, since 2×10102010122112 (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 (1010201012281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168366835366 + ... + 168366835371.
It is an arithmetic number, because the mean of its divisors is an integer number (336733670738).
Almost surely, 21010201012211 is an apocalyptic number.
1010201012211 is a deficient number, since it is larger than the sum of its proper divisors (336733670741).
1010201012211 is an equidigital number, since it uses as much as digits as its factorization.
1010201012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336733670740.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1010201012211 its reverse (1122101020101), we get a palindrome (2132302032312).
The spelling of 1010201012211 in words is "one trillion, ten billion, two hundred one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.872 sec. • engine limits •