Base | Representation |
---|---|
bin | 1001010111101011000100… |
… | …0011110001110001000001 |
3 | 1100110220001011000202210021 |
4 | 2111322301003301301001 |
5 | 2322243103321231223 |
6 | 33524451240533441 |
7 | 2112213436154611 |
oct | 225726103616101 |
9 | 40426034022707 |
10 | 10302302133313 |
11 | 33121aaa79133 |
12 | 11a47a4181281 |
13 | 59966cbc8298 |
14 | 2788c3cd6a41 |
15 | 12cebe79565d |
hex | 95eb10f1c41 |
10302302133313 has 2 divisors, whose sum is σ = 10302302133314. Its totient is φ = 10302302133312.
The previous prime is 10302302133301. The next prime is 10302302133371. The reversal of 10302302133313 is 31333120320301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10285926580224 + 16375553089 = 3207168^2 + 127967^2 .
It is a cyclic number.
It is not a de Polignac number, because 10302302133313 - 213 = 10302302125121 is a prime.
It is a super-2 number, since 2×103023021333132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302302143313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151151066656 + 5151151066657.
It is an arithmetic number, because the mean of its divisors is an integer number (5151151066657).
Almost surely, 210302302133313 is an apocalyptic number.
It is an amenable number.
10302302133313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302302133313 is an equidigital number, since it uses as much as digits as its factorization.
10302302133313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 10302302133313 its reverse (31333120320301), we get a palindrome (41635422453614).
The spelling of 10302302133313 in words is "ten trillion, three hundred two billion, three hundred two million, one hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •