Base | Representation |
---|---|
bin | 101100100101000010101… |
… | …100010011010010100001 |
3 | 101211212020202010012020022 |
4 | 230211002230103102201 |
5 | 400142401212413044 |
6 | 10303153125123225 |
7 | 434216444250521 |
oct | 54450254232241 |
9 | 11755222105208 |
10 | 3063430591649 |
11 | a8121478404a |
12 | 415868859515 |
13 | 192b59c3427c |
14 | a83b123b681 |
15 | 54a482433ee |
hex | 2c942b134a1 |
3063430591649 has 2 divisors, whose sum is σ = 3063430591650. Its totient is φ = 3063430591648.
The previous prime is 3063430591643. The next prime is 3063430591799. The reversal of 3063430591649 is 9461950343603.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2451917539600 + 611513052049 = 1565860^2 + 781993^2 .
It is a cyclic number.
It is not a de Polignac number, because 3063430591649 - 216 = 3063430526113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3063430591649.
It is not a weakly prime, because it can be changed into another prime (3063430591643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1531715295824 + 1531715295825.
It is an arithmetic number, because the mean of its divisors is an integer number (1531715295825).
Almost surely, 23063430591649 is an apocalyptic number.
It is an amenable number.
3063430591649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3063430591649 is an equidigital number, since it uses as much as digits as its factorization.
3063430591649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6298560, while the sum is 53.
The spelling of 3063430591649 in words is "three trillion, sixty-three billion, four hundred thirty million, five hundred ninety-one thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •