Base | Representation |
---|---|
bin | 11101011011001010000… |
… | …01100011110001000101 |
3 | 10120122121011212021011220 |
4 | 32231211001203301011 |
5 | 113031023112101041 |
6 | 2052241432350553 |
7 | 133020553044414 |
oct | 16554501436105 |
9 | 3518534767156 |
10 | 1011012222021 |
11 | 35a84a05132a |
12 | 143b35b45459 |
13 | 744518b2249 |
14 | 36d0cbb947b |
15 | 1b47341bd66 |
hex | eb65063c45 |
1011012222021 has 4 divisors (see below), whose sum is σ = 1348016296032. Its totient is φ = 674008148012.
The previous prime is 1011012221983. The next prime is 1011012222041. The reversal of 1011012222021 is 1202222101101.
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 1011012222021 - 29 = 1011012221509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011012222041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168502037001 + ... + 168502037006.
It is an arithmetic number, because the mean of its divisors is an integer number (337004074008).
Almost surely, 21011012222021 is an apocalyptic number.
It is an amenable number.
1011012222021 is a deficient number, since it is larger than the sum of its proper divisors (337004074011).
1011012222021 is an equidigital number, since it uses as much as digits as its factorization.
1011012222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337004074010.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1011012222021 its reverse (1202222101101), we get a palindrome (2213234323122).
The spelling of 1011012222021 in words is "one trillion, eleven billion, twelve million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •