Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …11111001000101001101 |
3 | 10120122121210210112010122 |
4 | 32231211203321011031 |
5 | 113031032413102341 |
6 | 2052242353314325 |
7 | 133021022411153 |
oct | 16554543710515 |
9 | 3518553715118 |
10 | 1011021222221 |
11 | 35a85413930a |
12 | 143b38b659a5 |
13 | 744537139ca |
14 | 36d1007d3d3 |
15 | 1b4740e894b |
hex | eb658f914d |
1011021222221 has 8 divisors (see below), whose sum is σ = 1052067809760. Its totient is φ = 970771655952.
The previous prime is 1011021222209. The next prime is 1011021222227. The reversal of 1011021222221 is 1222221201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011021222221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1011021222221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011021222227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199252730 + ... + 199257803.
It is an arithmetic number, because the mean of its divisors is an integer number (131508476220).
Almost surely, 21011021222221 is an apocalyptic number.
It is an amenable number.
1011021222221 is a deficient number, since it is larger than the sum of its proper divisors (41046587539).
1011021222221 is an equidigital number, since it uses as much as digits as its factorization.
1011021222221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398510635.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1011021222221 its reverse (1222221201101), we get a palindrome (2233242423322).
The spelling of 1011021222221 in words is "one trillion, eleven billion, twenty-one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •