Base | Representation |
---|---|
bin | 1101101100000101011001… |
… | …11011101010010011110001 |
3 | 10221120201121101011001211112 |
4 | 12312002230323222103301 |
5 | 12421142430211200223 |
6 | 144004403241523105 |
7 | 6224541263242622 |
oct | 666025473522361 |
9 | 127521541131745 |
10 | 30102032131313 |
11 | 965622241a51a |
12 | 3461b857a3495 |
13 | 13a47bcc6614c |
14 | 760d3626ba49 |
15 | 373052621778 |
hex | 1b60aceea4f1 |
30102032131313 has 2 divisors, whose sum is σ = 30102032131314. Its totient is φ = 30102032131312.
The previous prime is 30102032131271. The next prime is 30102032131357. The reversal of 30102032131313 is 31313123020103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28931790653584 + 1170241477729 = 5378828^2 + 1081777^2 .
It is a cyclic number.
It is not a de Polignac number, because 30102032131313 - 232 = 30097737164017 is a prime.
It is a super-2 number, since 2×301020321313132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30102032101313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051016065656 + 15051016065657.
It is an arithmetic number, because the mean of its divisors is an integer number (15051016065657).
Almost surely, 230102032131313 is an apocalyptic number.
It is an amenable number.
30102032131313 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102032131313 is an equidigital number, since it uses as much as digits as its factorization.
30102032131313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 30102032131313 its reverse (31313123020103), we get a palindrome (61415155151416).
The spelling of 30102032131313 in words is "thirty trillion, one hundred two billion, thirty-two million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •