Base | Representation |
---|---|
bin | 10111001100101111000111… |
… | …111010100011000010001001 |
3 | 111101021000001011222002111111 |
4 | 113030233013322203002021 |
5 | 101333131024321132223 |
6 | 1001000023531330321 |
7 | 30330306000410464 |
oct | 2714570772430211 |
9 | 441230034862444 |
10 | 102030302130313 |
11 | 2a56789869aa67 |
12 | b53a1a58b09a1 |
13 | 44c1554537a2b |
14 | 1b2a415cb62db |
15 | bbe097ba630d |
hex | 5ccbc7ea3089 |
102030302130313 has 2 divisors, whose sum is σ = 102030302130314. Its totient is φ = 102030302130312.
The previous prime is 102030302130311. The next prime is 102030302130391. The reversal of 102030302130313 is 313031203030201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90885467691769 + 11144834438544 = 9533387^2 + 3338388^2 .
It is a cyclic number.
It is not a de Polignac number, because 102030302130313 - 21 = 102030302130311 is a prime.
Together with 102030302130311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102030302130311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51015151065156 + 51015151065157.
It is an arithmetic number, because the mean of its divisors is an integer number (51015151065157).
Almost surely, 2102030302130313 is an apocalyptic number.
It is an amenable number.
102030302130313 is a deficient number, since it is larger than the sum of its proper divisors (1).
102030302130313 is an equidigital number, since it uses as much as digits as its factorization.
102030302130313 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 22.
Adding to 102030302130313 its reverse (313031203030201), we get a palindrome (415061505160514).
The spelling of 102030302130313 in words is "one hundred two trillion, thirty billion, three hundred two million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •