Base | Representation |
---|---|
bin | 1001010001101110110010… |
… | …0011100111011010001001 |
3 | 1100010010112221121000010111 |
4 | 2110123230203213122021 |
5 | 2314110023101321022 |
6 | 33405530014314321 |
7 | 2101640662651366 |
oct | 224335443473211 |
9 | 40103487530114 |
10 | 10200221120137 |
11 | 32829869a3034 |
12 | 1188a554b89a1 |
13 | 58cb52217bc9 |
14 | 27399c72d46d |
15 | 12a4e79e4477 |
hex | 946ec8e7689 |
10200221120137 has 2 divisors, whose sum is σ = 10200221120138. Its totient is φ = 10200221120136.
The previous prime is 10200221120107. The next prime is 10200221120143. The reversal of 10200221120137 is 73102112200201.
10200221120137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8312905670521 + 1887315449616 = 2883211^2 + 1373796^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200221120137 - 235 = 10165861381769 is a prime.
It is not a weakly prime, because it can be changed into another prime (10200221120107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100110560068 + 5100110560069.
It is an arithmetic number, because the mean of its divisors is an integer number (5100110560069).
Almost surely, 210200221120137 is an apocalyptic number.
It is an amenable number.
10200221120137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200221120137 is an equidigital number, since it uses as much as digits as its factorization.
10200221120137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 10200221120137 its reverse (73102112200201), we get a palindrome (83302333320338).
The spelling of 10200221120137 in words is "ten trillion, two hundred billion, two hundred twenty-one million, one hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •