Base | Representation |
---|---|
bin | 101011111111100000100… |
… | …110111001011010100001 |
3 | 101201000020011000100221011 |
4 | 223333200212321122201 |
5 | 344012332324131423 |
6 | 10232450142100521 |
7 | 431261662403155 |
oct | 53774046713241 |
9 | 11630204010834 |
10 | 3023130302113 |
11 | a66114274039 |
12 | 409aa027a741 |
13 | 18c1068b21bc |
14 | a646ac23065 |
15 | 5398a1e1b0d |
hex | 2bfe09b96a1 |
3023130302113 has 2 divisors, whose sum is σ = 3023130302114. Its totient is φ = 3023130302112.
The previous prime is 3023130302111. The next prime is 3023130302147. The reversal of 3023130302113 is 3112030313203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2929550597649 + 93579704464 = 1711593^2 + 305908^2 .
It is a cyclic number.
It is not a de Polignac number, because 3023130302113 - 21 = 3023130302111 is a prime.
Together with 3023130302111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3023130302111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511565151056 + 1511565151057.
It is an arithmetic number, because the mean of its divisors is an integer number (1511565151057).
Almost surely, 23023130302113 is an apocalyptic number.
It is an amenable number.
3023130302113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3023130302113 is an equidigital number, since it uses as much as digits as its factorization.
3023130302113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3023130302113 its reverse (3112030313203), we get a palindrome (6135160615316).
The spelling of 3023130302113 in words is "three trillion, twenty-three billion, one hundred thirty million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •