Base | Representation |
---|---|
bin | 11101011001101010101… |
… | …01110000011000101101 |
3 | 10120120112102111110022020 |
4 | 32230311111300120231 |
5 | 113022403311211341 |
6 | 2052030213340353 |
7 | 132662000051454 |
oct | 16546525603055 |
9 | 3516472443266 |
10 | 1010212210221 |
11 | 35a479502655 |
12 | 1439520376b9 |
13 | 74354c26b96 |
14 | 36c74849b9b |
15 | 1b428091566 |
hex | eb3557062d |
1010212210221 has 4 divisors (see below), whose sum is σ = 1346949613632. Its totient is φ = 673474806812.
The previous prime is 1010212210201. The next prime is 1010212210223. The reversal of 1010212210221 is 1220122120101.
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 1010212210221 - 26 = 1010212210157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010212210221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010212210223) 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, 168368701701 + ... + 168368701706.
It is an arithmetic number, because the mean of its divisors is an integer number (336737403408).
Almost surely, 21010212210221 is an apocalyptic number.
It is an amenable number.
1010212210221 is a deficient number, since it is larger than the sum of its proper divisors (336737403411).
1010212210221 is an equidigital number, since it uses as much as digits as its factorization.
1010212210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336737403410.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1010212210221 its reverse (1220122120101), we get a palindrome (2230334330322).
The spelling of 1010212210221 in words is "one trillion, ten billion, two hundred twelve million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •