Base | Representation |
---|---|
bin | 1001010111110101101011… |
… | …1111000100100010100101 |
3 | 1100111011101211111010122012 |
4 | 2111331122333010202211 |
5 | 2322314423133314323 |
6 | 33530042201244005 |
7 | 2112344204306663 |
oct | 225753277044245 |
9 | 40434354433565 |
10 | 10305153026213 |
11 | 3313433257171 |
12 | 11a525aa93605 |
13 | 599a05734166 |
14 | 278ab47a7c33 |
15 | 12d0d9bd4678 |
hex | 95f5afc48a5 |
10305153026213 has 2 divisors, whose sum is σ = 10305153026214. Its totient is φ = 10305153026212.
The previous prime is 10305153026191. The next prime is 10305153026279. The reversal of 10305153026213 is 31262035150301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6626129812129 + 3679023214084 = 2574127^2 + 1918078^2 .
It is a cyclic number.
It is not a de Polignac number, because 10305153026213 - 28 = 10305153025957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10305153026213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10305153026293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152576513106 + 5152576513107.
It is an arithmetic number, because the mean of its divisors is an integer number (5152576513107).
Almost surely, 210305153026213 is an apocalyptic number.
It is an amenable number.
10305153026213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10305153026213 is an equidigital number, since it uses as much as digits as its factorization.
10305153026213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 10305153026213 its reverse (31262035150301), we get a palindrome (41567188176514).
The spelling of 10305153026213 in words is "ten trillion, three hundred five billion, one hundred fifty-three million, twenty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •