Base | Representation |
---|---|
bin | 1001010010011110110001… |
… | …0010110010100110000001 |
3 | 1100011100210121111202102012 |
4 | 2110213230102302212001 |
5 | 2314312413003031033 |
6 | 33415500100102305 |
7 | 2102605115222132 |
oct | 224475422624601 |
9 | 40140717452365 |
10 | 10213101611393 |
11 | 328839667182a |
12 | 118b44b094995 |
13 | 591125905475 |
14 | 274461269c89 |
15 | 12a9ed6db248 |
hex | 949ec4b2981 |
10213101611393 has 2 divisors, whose sum is σ = 10213101611394. Its totient is φ = 10213101611392.
The previous prime is 10213101611387. The next prime is 10213101611417. The reversal of 10213101611393 is 39311610131201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6712954537969 + 3500147073424 = 2590937^2 + 1870868^2 .
It is a cyclic number.
It is not a de Polignac number, because 10213101611393 - 242 = 5815055100289 is a prime.
It is not a weakly prime, because it can be changed into another prime (10213101611303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106550805696 + 5106550805697.
It is an arithmetic number, because the mean of its divisors is an integer number (5106550805697).
Almost surely, 210213101611393 is an apocalyptic number.
It is an amenable number.
10213101611393 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213101611393 is an equidigital number, since it uses as much as digits as its factorization.
10213101611393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 32.
Adding to 10213101611393 its reverse (39311610131201), we get a palindrome (49524711742594).
The spelling of 10213101611393 in words is "ten trillion, two hundred thirteen billion, one hundred one million, six hundred eleven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •