Base | Representation |
---|---|
bin | 110110011111101101010… |
… | …1001000100101011001101 |
3 | 222112000110202220210102201 |
4 | 1230333122221010223031 |
5 | 1440203100311301234 |
6 | 23532433113521501 |
7 | 1402056063151144 |
oct | 154773251045315 |
9 | 28460422823381 |
10 | 7489796197069 |
11 | 242844a77065a |
12 | a0b6a5713291 |
13 | 42439179c994 |
14 | 1bc71820475b |
15 | cec60618314 |
hex | 6cfdaa44acd |
7489796197069 has 2 divisors, whose sum is σ = 7489796197070. Its totient is φ = 7489796197068.
The previous prime is 7489796197043. The next prime is 7489796197127. The reversal of 7489796197069 is 9607916979847.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4413234592900 + 3076561604169 = 2100770^2 + 1754013^2 .
It is a cyclic number.
It is not a de Polignac number, because 7489796197069 - 213 = 7489796188877 is a prime.
It is a super-2 number, since 2×74897961970692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7489796196983 and 7489796197001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7489796897069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3744898098534 + 3744898098535.
It is an arithmetic number, because the mean of its divisors is an integer number (3744898098535).
Almost surely, 27489796197069 is an apocalyptic number.
It is an amenable number.
7489796197069 is a deficient number, since it is larger than the sum of its proper divisors (1).
7489796197069 is an equidigital number, since it uses as much as digits as its factorization.
7489796197069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592487296, while the sum is 82.
The spelling of 7489796197069 in words is "seven trillion, four hundred eighty-nine billion, seven hundred ninety-six million, one hundred ninety-seven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •