Base | Representation |
---|---|
bin | 1110010101000101… |
… | …01011011111110101 |
3 | 201212010211201212121 |
4 | 13022202223133311 |
5 | 111223410242424 |
6 | 3311212515541 |
7 | 361432616443 |
oct | 71242533765 |
9 | 21763751777 |
10 | 7693055989 |
11 | 3298590913 |
12 | 15a847bbb1 |
13 | 957a83748 |
14 | 52da07b93 |
15 | 3005b8ee4 |
hex | 1ca8ab7f5 |
7693055989 has 2 divisors, whose sum is σ = 7693055990. Its totient is φ = 7693055988.
The previous prime is 7693055987. The next prime is 7693056001. The reversal of 7693055989 is 9895503967.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4971660100 + 2721395889 = 70510^2 + 52167^2 .
It is an emirp because it is prime and its reverse (9895503967) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7693055989 - 21 = 7693055987 is a prime.
It is a super-2 number, since 2×76930559892 (a number of 21 digits) contains 22 as substring.
Together with 7693055987, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7693055987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3846527994 + 3846527995.
It is an arithmetic number, because the mean of its divisors is an integer number (3846527995).
Almost surely, 27693055989 is an apocalyptic number.
It is an amenable number.
7693055989 is a deficient number, since it is larger than the sum of its proper divisors (1).
7693055989 is an equidigital number, since it uses as much as digits as its factorization.
7693055989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18370800, while the sum is 61.
The square root of 7693055989 is about 87710.0677744579. The cubic root of 7693055989 is about 1974.0870417190.
The spelling of 7693055989 in words is "seven billion, six hundred ninety-three million, fifty-five thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •