Base | Representation |
---|---|
bin | 1001001101101001111100… |
… | …0010001011011000010101 |
3 | 1022212102211010102222210201 |
4 | 2103122133002023120111 |
5 | 2311433122431012323 |
6 | 33313430005020501 |
7 | 2063611553015353 |
oct | 223323702133025 |
9 | 38772733388721 |
10 | 10130201032213 |
11 | 3256215430679 |
12 | 11773739b4731 |
13 | 586373889112 |
14 | 2704391a87d3 |
15 | 12879a7668ad |
hex | 9369f08b615 |
10130201032213 has 2 divisors, whose sum is σ = 10130201032214. Its totient is φ = 10130201032212.
The previous prime is 10130201032187. The next prime is 10130201032253. The reversal of 10130201032213 is 31223010203101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9976457053809 + 153743978404 = 3158553^2 + 392102^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130201032213 - 25 = 10130201032181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10130201032253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065100516106 + 5065100516107.
It is an arithmetic number, because the mean of its divisors is an integer number (5065100516107).
Almost surely, 210130201032213 is an apocalyptic number.
It is an amenable number.
10130201032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130201032213 is an equidigital number, since it uses as much as digits as its factorization.
10130201032213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10130201032213 its reverse (31223010203101), we get a palindrome (41353211235314).
The spelling of 10130201032213 in words is "ten trillion, one hundred thirty billion, two hundred one million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •