Base | Representation |
---|---|
bin | 1001000110110010011000… |
… | …1110001011111100100101 |
3 | 1022110011021010112112122021 |
4 | 2101230212032023330211 |
5 | 2303020001231121013 |
6 | 33143313520103141 |
7 | 2052233616660526 |
oct | 221544616137445 |
9 | 38404233475567 |
10 | 10012210020133 |
11 | 32101775a1952 |
12 | 1158524a64ab1 |
13 | 5781bb9750c9 |
14 | 2688449ba84d |
15 | 125691d4ba8d |
hex | 91b2638bf25 |
10012210020133 has 2 divisors, whose sum is σ = 10012210020134. Its totient is φ = 10012210020132.
The previous prime is 10012210020119. The next prime is 10012210020143. The reversal of 10012210020133 is 33102001221001.
10012210020133 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., 9267263231524 + 744946788609 = 3044218^2 + 863103^2 .
It is a cyclic number.
It is not a de Polignac number, because 10012210020133 - 25 = 10012210020101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10012210020143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006105010066 + 5006105010067.
It is an arithmetic number, because the mean of its divisors is an integer number (5006105010067).
Almost surely, 210012210020133 is an apocalyptic number.
It is an amenable number.
10012210020133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012210020133 is an equidigital number, since it uses as much as digits as its factorization.
10012210020133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10012210020133 its reverse (33102001221001), we get a palindrome (43114211241134).
The spelling of 10012210020133 in words is "ten trillion, twelve billion, two hundred ten million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •