Base | Representation |
---|---|
bin | 1001010001101110110010… |
… | …0011111101110101100001 |
3 | 1100010010112221202200010212 |
4 | 2110123230203331311201 |
5 | 2314110023112241001 |
6 | 33405530020303505 |
7 | 2101640663513252 |
oct | 224335443756541 |
9 | 40103487680125 |
10 | 10200221212001 |
11 | 3282986a56057 |
12 | 1188a55541b95 |
13 | 58cb5224a972 |
14 | 27399c754b29 |
15 | 12a4e7a117bb |
hex | 946ec8fdd61 |
10200221212001 has 4 divisors (see below), whose sum is σ = 10200241223172. Its totient is φ = 10200201200832.
The previous prime is 10200221211913. The next prime is 10200221212031. The reversal of 10200221212001 is 10021212200201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4031256824401 + 6168964387600 = 2007799^2 + 2483740^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200221212001 - 226 = 10200154103137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200221212031) 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, 9220460 + ... + 10267293.
It is an arithmetic number, because the mean of its divisors is an integer number (2550060305793).
Almost surely, 210200221212001 is an apocalyptic number.
It is an amenable number.
10200221212001 is a deficient number, since it is larger than the sum of its proper divisors (20011171).
10200221212001 is an equidigital number, since it uses as much as digits as its factorization.
10200221212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20011170.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10200221212001 its reverse (10021212200201), we get a palindrome (20221433412202).
The spelling of 10200221212001 in words is "ten trillion, two hundred billion, two hundred twenty-one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •