Base | Representation |
---|---|
bin | 1001001110000001… |
… | …1110011011011101 |
3 | 20101110201000222211 |
4 | 2103200132123131 |
5 | 20032014421442 |
6 | 1045322440421 |
7 | 115220101246 |
oct | 22340363335 |
9 | 6343630884 |
10 | 2474763997 |
11 | 105aa37902 |
12 | 590963111 |
13 | 3059349c4 |
14 | 196961ccd |
15 | e73e3617 |
hex | 9381e6dd |
2474763997 has 2 divisors, whose sum is σ = 2474763998. Its totient is φ = 2474763996.
The previous prime is 2474763989. The next prime is 2474764031. The reversal of 2474763997 is 7993674742.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2218315801 + 256448196 = 47099^2 + 16014^2 .
It is a cyclic number.
It is not a de Polignac number, because 2474763997 - 23 = 2474763989 is a prime.
It is a super-2 number, since 2×24747639972 = 12248913681694832018, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2474763937) 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, 1237381998 + 1237381999.
It is an arithmetic number, because the mean of its divisors is an integer number (1237381999).
Almost surely, 22474763997 is an apocalyptic number.
It is an amenable number.
2474763997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2474763997 is an equidigital number, since it uses as much as digits as its factorization.
2474763997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16003008, while the sum is 58.
The square root of 2474763997 is about 49746.9998793897. Note that the first 3 decimals coincide. The cubic root of 2474763997 is about 1352.6266186411.
The spelling of 2474763997 in words is "two billion, four hundred seventy-four million, seven hundred sixty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •