Base | Representation |
---|---|
bin | 1001010010010111010100… |
… | …0110111000110011011001 |
3 | 1100011011122020220002112121 |
4 | 2110211311012320303121 |
5 | 2314244314103034033 |
6 | 33414525425341241 |
7 | 2102504424636235 |
oct | 224456506706331 |
9 | 40134566802477 |
10 | 10211102002393 |
11 | 328755a971a06 |
12 | 118ab91497821 |
13 | 590b97567086 |
14 | 2743118735c5 |
15 | 12a932da462d |
hex | 949751b8cd9 |
10211102002393 has 2 divisors, whose sum is σ = 10211102002394. Its totient is φ = 10211102002392.
The previous prime is 10211102002379. The next prime is 10211102002457. The reversal of 10211102002393 is 39320020111201.
10211102002393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6850322105344 + 3360779897049 = 2617312^2 + 1833243^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211102002393 - 225 = 10211068447961 is a prime.
It is not a weakly prime, because it can be changed into another prime (10211102002093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105551001196 + 5105551001197.
It is an arithmetic number, because the mean of its divisors is an integer number (5105551001197).
Almost surely, 210211102002393 is an apocalyptic number.
It is an amenable number.
10211102002393 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211102002393 is an equidigital number, since it uses as much as digits as its factorization.
10211102002393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 10211102002393 its reverse (39320020111201), we get a palindrome (49531122113594).
The spelling of 10211102002393 in words is "ten trillion, two hundred eleven billion, one hundred two million, two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •