Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1101010010100000000001 |
3 | 1100010010020122111010222211 |
4 | 2110123211131102200001 |
5 | 2314104302104133441 |
6 | 33405510121502121 |
7 | 2101635015432055 |
oct | 224334535224001 |
9 | 40103218433884 |
10 | 10200102021121 |
11 | 32829257471a1 |
12 | 1188a21641941 |
13 | 58cb3364810c |
14 | 27398a9a9c65 |
15 | 12a4dc31aa81 |
hex | 946e5752801 |
10200102021121 has 4 divisors (see below), whose sum is σ = 10200396950100. Its totient is φ = 10199807092144.
The previous prime is 10200102021113. The next prime is 10200102021149. The reversal of 10200102021121 is 12112020100201.
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 1356234930625 + 8843867090496 = 1164575^2 + 2973864^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200102021121 - 23 = 10200102021113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200102021521) 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, 147412606 + ... + 147481783.
It is an arithmetic number, because the mean of its divisors is an integer number (2550099237525).
Almost surely, 210200102021121 is an apocalyptic number.
It is an amenable number.
10200102021121 is a deficient number, since it is larger than the sum of its proper divisors (294928979).
10200102021121 is an equidigital number, since it uses as much as digits as its factorization.
10200102021121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294928978.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10200102021121 its reverse (12112020100201), we get a palindrome (22312122121322).
The spelling of 10200102021121 in words is "ten trillion, two hundred billion, one hundred two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •