Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000110011010001110101 |
3 | 1022202120011210222012221121 |
4 | 2102332132020303101311 |
5 | 2310440022013021323 |
6 | 33251533122143541 |
7 | 2061465263565433 |
oct | 222763610632165 |
9 | 38676153865847 |
10 | 10100121220213 |
11 | 324448a134712 |
12 | 117157a1b1bb1 |
13 | 58358bacb3ab |
14 | 26cbc4305d53 |
15 | 127ad9b24a5d |
hex | 92f9e233475 |
10100121220213 has 2 divisors, whose sum is σ = 10100121220214. Its totient is φ = 10100121220212.
The previous prime is 10100121220183. The next prime is 10100121220219. The reversal of 10100121220213 is 31202212100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10094841308644 + 5279911569 = 3177238^2 + 72663^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100121220213 - 225 = 10100087665781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100121220219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050060610106 + 5050060610107.
It is an arithmetic number, because the mean of its divisors is an integer number (5050060610107).
Almost surely, 210100121220213 is an apocalyptic number.
It is an amenable number.
10100121220213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100121220213 is an equidigital number, since it uses as much as digits as its factorization.
10100121220213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10100121220213 its reverse (31202212100101), we get a palindrome (41302333320314).
The spelling of 10100121220213 in words is "ten trillion, one hundred billion, one hundred twenty-one million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •