Base | Representation |
---|---|
bin | 101100100100110000000… |
… | …010000000100011110101 |
3 | 101211211102221000020210202 |
4 | 230210300002000203311 |
5 | 400141231040434442 |
6 | 10303102102530245 |
7 | 434205623165561 |
oct | 54446002004365 |
9 | 11754387006722 |
10 | 3063117514997 |
11 | a81073a88a11 |
12 | 41579ba36985 |
13 | 192b0a108407 |
14 | a83818226a1 |
15 | 54a2a9eec32 |
hex | 2c9300808f5 |
3063117514997 has 2 divisors, whose sum is σ = 3063117514998. Its totient is φ = 3063117514996.
The previous prime is 3063117514973. The next prime is 3063117515041. The reversal of 3063117514997 is 7994157113603.
3063117514997 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2803434527716 + 259682987281 = 1674346^2 + 509591^2 .
It is an emirp because it is prime and its reverse (7994157113603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3063117514997 - 216 = 3063117449461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3063117514937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1531558757498 + 1531558757499.
It is an arithmetic number, because the mean of its divisors is an integer number (1531558757499).
Almost surely, 23063117514997 is an apocalyptic number.
It is an amenable number.
3063117514997 is a deficient number, since it is larger than the sum of its proper divisors (1).
3063117514997 is an equidigital number, since it uses as much as digits as its factorization.
3063117514997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4286520, while the sum is 56.
The spelling of 3063117514997 in words is "three trillion, sixty-three billion, one hundred seventeen million, five hundred fourteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •