Base | Representation |
---|---|
bin | 101100000000011011100… |
… | …111100011111011011101 |
3 | 101201002210010221002121122 |
4 | 230000123213203323131 |
5 | 344021344301110442 |
6 | 10233132305540325 |
7 | 431325343460522 |
oct | 54003347437335 |
9 | 11632703832548 |
10 | 3024120331997 |
11 | a665820a8156 |
12 | 40a1179446a5 |
13 | 18c233a3b2bb |
14 | a65224d7149 |
15 | 539e70a3dd2 |
hex | 2c01b9e3edd |
3024120331997 has 2 divisors, whose sum is σ = 3024120331998. Its totient is φ = 3024120331996.
The previous prime is 3024120331957. The next prime is 3024120332003. The reversal of 3024120331997 is 7991330214203.
3024120331997 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2953520653561 + 70599678436 = 1718581^2 + 265706^2 .
It is a cyclic number.
It is not a de Polignac number, because 3024120331997 - 230 = 3023046590173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3024120331957) 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, 1512060165998 + 1512060165999.
It is an arithmetic number, because the mean of its divisors is an integer number (1512060165999).
Almost surely, 23024120331997 is an apocalyptic number.
It is an amenable number.
3024120331997 is a deficient number, since it is larger than the sum of its proper divisors (1).
3024120331997 is an equidigital number, since it uses as much as digits as its factorization.
3024120331997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 244944, while the sum is 44.
The spelling of 3024120331997 in words is "three trillion, twenty-four billion, one hundred twenty million, three hundred thirty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •