Base | Representation |
---|---|
bin | 10101111110010011… |
… | …11111001100100101 |
3 | 1010110011010202001212 |
4 | 22333021333030211 |
5 | 143130013012442 |
6 | 5230334401205 |
7 | 565224565625 |
oct | 127711771445 |
9 | 33404122055 |
10 | 11797000997 |
11 | 5004110501 |
12 | 2352960205 |
13 | 116009a482 |
14 | 7dca98885 |
15 | 490a22a82 |
hex | 2bf27f325 |
11797000997 has 4 divisors (see below), whose sum is σ = 11929551660. Its totient is φ = 11664450336.
The previous prime is 11797000951. The next prime is 11797001011. The reversal of 11797000997 is 79900079711.
It is a happy number.
It is a Cunningham number, because it is equal to 1086142+1.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79900079711 = 5101 ⋅15663611.
It can be written as a sum of positive squares in 2 ways, for example, as 2265188836 + 9531812161 = 47594^2 + 97631^2 .
It is a cyclic number.
It is not a de Polignac number, because 11797000997 - 26 = 11797000933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11797000297) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66275198 + ... + 66275375.
It is an arithmetic number, because the mean of its divisors is an integer number (2982387915).
Almost surely, 211797000997 is an apocalyptic number.
It is an amenable number.
11797000997 is a deficient number, since it is larger than the sum of its proper divisors (132550663).
11797000997 is an equidigital number, since it uses as much as digits as its factorization.
11797000997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132550662.
The product of its (nonzero) digits is 250047, while the sum is 50.
The spelling of 11797000997 in words is "eleven billion, seven hundred ninety-seven million, nine hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •