Base | Representation |
---|---|
bin | 1001000110001100010111… |
… | …0010000011111111111101 |
3 | 1022102011220201112111000102 |
4 | 2101203011302003333331 |
5 | 2302333100014201341 |
6 | 33134504545010445 |
7 | 2051422636044215 |
oct | 221430562037775 |
9 | 38364821474012 |
10 | 10002002100221 |
11 | 32069094855aa |
12 | 1156556323a25 |
13 | 577252b89801 |
14 | 268156db3245 |
15 | 125295abcc9b |
hex | 918c5c83ffd |
10002002100221 has 4 divisors (see below), whose sum is σ = 10099108916832. Its totient is φ = 9904895283612.
The previous prime is 10002002100199. The next prime is 10002002100241. The reversal of 10002002100221 is 12200120020001.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-10002002100221 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002002100241) 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, 48553408151 + ... + 48553408356.
It is an arithmetic number, because the mean of its divisors is an integer number (2524777229208).
Almost surely, 210002002100221 is an apocalyptic number.
It is an amenable number.
10002002100221 is a deficient number, since it is larger than the sum of its proper divisors (97106816611).
10002002100221 is an equidigital number, since it uses as much as digits as its factorization.
10002002100221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97106816610.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10002002100221 its reverse (12200120020001), we get a palindrome (22202122120222).
The spelling of 10002002100221 in words is "ten trillion, two billion, two million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •