Base | Representation |
---|---|
bin | 1001010001101110011010… |
… | …0101110001001001001001 |
3 | 1100010010021222020102221002 |
4 | 2110123212211301021021 |
5 | 2314104321440133001 |
6 | 33405512041024345 |
7 | 2101635336064232 |
oct | 224334645611111 |
9 | 40103258212832 |
10 | 10200121021001 |
11 | 328293544407a |
12 | 1188a27a850b5 |
13 | 58cb3756b252 |
14 | 27398d314089 |
15 | 12a4ddd2046b |
hex | 946e6971249 |
10200121021001 has 4 divisors (see below), whose sum is σ = 10551849332100. Its totient is φ = 9848392709904.
The previous prime is 10200121020983. The next prime is 10200121021003. The reversal of 10200121021001 is 10012012100201.
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 3691397532601 + 6508723488400 = 1921301^2 + 2551220^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200121021001 - 218 = 10200120758857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200121021003) 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, 175864155506 + ... + 175864155563.
It is an arithmetic number, because the mean of its divisors is an integer number (2637962333025).
Almost surely, 210200121021001 is an apocalyptic number.
It is an amenable number.
10200121021001 is a deficient number, since it is larger than the sum of its proper divisors (351728311099).
10200121021001 is an equidigital number, since it uses as much as digits as its factorization.
10200121021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 351728311098.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10200121021001 its reverse (10012012100201), we get a palindrome (20212133121202).
The spelling of 10200121021001 in words is "ten trillion, two hundred billion, one hundred twenty-one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •