Base | Representation |
---|---|
bin | 1000101111001011… |
… | …01001110110001101 |
3 | 110002220101221221001 |
4 | 10113211221312031 |
5 | 34101310321442 |
6 | 2053242140301 |
7 | 224145261004 |
oct | 42745516615 |
9 | 13086357831 |
10 | 4690713997 |
11 | 1a97870942 |
12 | aaaab1691 |
13 | 599a5c218 |
14 | 326d91c3b |
15 | 1c6c112b7 |
hex | 117969d8d |
4690713997 has 2 divisors, whose sum is σ = 4690713998. Its totient is φ = 4690713996.
The previous prime is 4690713983. The next prime is 4690714003. The reversal of 4690713997 is 7993170964.
4690713997 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., 4402189801 + 288524196 = 66349^2 + 16986^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4690713997 is a prime.
It is a super-4 number, since 4×46907139974 (a number of 40 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4690713947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2345356998 + 2345356999.
It is an arithmetic number, because the mean of its divisors is an integer number (2345356999).
Almost surely, 24690713997 is an apocalyptic number.
It is an amenable number.
4690713997 is a deficient number, since it is larger than the sum of its proper divisors (1).
4690713997 is an equidigital number, since it uses as much as digits as its factorization.
4690713997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2571912, while the sum is 55.
The square root of 4690713997 is about 68488.7873815853. The cubic root of 4690713997 is about 1673.9647865726.
The spelling of 4690713997 in words is "four billion, six hundred ninety million, seven hundred thirteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •