Base | Representation |
---|---|
bin | 1001010011011110000110… |
… | …1011000101110001011101 |
3 | 1100012222200111012002022202 |
4 | 2110313201223011301131 |
5 | 2320102222421114323 |
6 | 33431351121221245 |
7 | 2104046332212005 |
oct | 224674153056135 |
9 | 40188614162282 |
10 | 10230103301213 |
11 | 3294620684a54 |
12 | 11927b4a91825 |
13 | 59290506aa63 |
14 | 2751d5269005 |
15 | 12b1960e8d28 |
hex | 94de1ac5c5d |
10230103301213 has 2 divisors, whose sum is σ = 10230103301214. Its totient is φ = 10230103301212.
The previous prime is 10230103301179. The next prime is 10230103301227. The reversal of 10230103301213 is 31210330103201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8216352150724 + 2013751150489 = 2866418^2 + 1419067^2 .
It is a cyclic number.
It is not a de Polignac number, because 10230103301213 - 26 = 10230103301149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10230103301233) 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, 5115051650606 + 5115051650607.
It is an arithmetic number, because the mean of its divisors is an integer number (5115051650607).
Almost surely, 210230103301213 is an apocalyptic number.
It is an amenable number.
10230103301213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10230103301213 is an equidigital number, since it uses as much as digits as its factorization.
10230103301213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10230103301213 its reverse (31210330103201), we get a palindrome (41440433404414).
The spelling of 10230103301213 in words is "ten trillion, two hundred thirty billion, one hundred three million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •