Base | Representation |
---|---|
bin | 1001010111101001111100… |
… | …0100011101001010111101 |
3 | 1100110212021010010010102100 |
4 | 2111322133010131022331 |
5 | 2322241444040234323 |
6 | 33524401300015313 |
7 | 2112203112620136 |
oct | 225723704351275 |
9 | 40425233103370 |
10 | 10302000321213 |
11 | 3312065677247 |
12 | 11a471b091539 |
13 | 599622514743 |
14 | 278895bb0c8d |
15 | 12cea3029943 |
hex | 95e9f11d2bd |
10302000321213 has 12 divisors (see below), whose sum is σ = 14880697977340. Its totient is φ = 6867985977216.
The previous prime is 10302000321209. The next prime is 10302000321233. The reversal of 10302000321213 is 31212300020301.
It can be written as a sum of positive squares in 2 ways, for example, as 1999545886809 + 8302454434404 = 1414053^2 + 2881398^2 .
It is not a de Polignac number, because 10302000321213 - 22 = 10302000321209 is a prime.
It is a super-2 number, since 2×103020003212132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302000321233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5213445 + ... + 6912597.
Almost surely, 210302000321213 is an apocalyptic number.
It is an amenable number.
10302000321213 is a deficient number, since it is larger than the sum of its proper divisors (4578697656127).
10302000321213 is a wasteful number, since it uses less digits than its factorization.
10302000321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2372828 (or 2372825 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10302000321213 its reverse (31212300020301), we get a palindrome (41514300341514).
The spelling of 10302000321213 in words is "ten trillion, three hundred two billion, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •