Base | Representation |
---|---|
bin | 1001001100000010000100… |
… | …1101010111011100010101 |
3 | 1022202202212001210121022111 |
4 | 2103000201031113130111 |
5 | 2311004022434412323 |
6 | 33252535234431021 |
7 | 2061603625101226 |
oct | 223004115273425 |
9 | 38682761717274 |
10 | 10102320232213 |
11 | 3245408449a00 |
12 | 1171a92732471 |
13 | 58384c575121 |
14 | 26cd523a724d |
15 | 127bb7be8c0d |
hex | 93021357715 |
10102320232213 has 12 divisors (see below), whose sum is σ = 11104470779500. Its totient is φ = 9183706202880.
The previous prime is 10102320232183. The next prime is 10102320232331. The reversal of 10102320232213 is 31223202320101.
It can be written as a sum of positive squares in 2 ways, for example, as 4611743365009 + 5490576867204 = 2147497^2 + 2343198^2 .
It is not a de Polignac number, because 10102320232213 - 241 = 7903296976661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102320232013) 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 in 11 ways as a sum of consecutive naturals, for example, 4145413 + ... + 6114661.
Almost surely, 210102320232213 is an apocalyptic number.
It is an amenable number.
10102320232213 is a deficient number, since it is larger than the sum of its proper divisors (1002150547287).
10102320232213 is a wasteful number, since it uses less digits than its factorization.
10102320232213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011668 (or 2011657 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10102320232213 its reverse (31223202320101), we get a palindrome (41325522552314).
The spelling of 10102320232213 in words is "ten trillion, one hundred two billion, three hundred twenty million, two hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •