Base | Representation |
---|---|
bin | 1011011110000111010… |
… | …0001101011100001101 |
3 | 200211122121002022111221 |
4 | 2313201310031130031 |
5 | 11212040343312321 |
6 | 230310140243341 |
7 | 20144245054150 |
oct | 2674164153415 |
9 | 624577068457 |
10 | 197062088461 |
11 | 76634458837 |
12 | 32237840551 |
13 | 15776766394 |
14 | 9775c3bc97 |
15 | 51d5596e41 |
hex | 2de1d0d70d |
197062088461 has 4 divisors (see below), whose sum is σ = 225213815392. Its totient is φ = 168910361532.
The previous prime is 197062088413. The next prime is 197062088477. The reversal of 197062088461 is 164880260791.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 197062088461 - 211 = 197062086413 is a prime.
It is a super-2 number, since 2×1970620884612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 197062088399 and 197062088408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (197062088761) 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, 14075863455 + ... + 14075863468.
It is an arithmetic number, because the mean of its divisors is an integer number (56303453848).
Almost surely, 2197062088461 is an apocalyptic number.
It is an amenable number.
197062088461 is a deficient number, since it is larger than the sum of its proper divisors (28151726931).
197062088461 is an equidigital number, since it uses as much as digits as its factorization.
197062088461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28151726930.
The product of its (nonzero) digits is 1161216, while the sum is 52.
The spelling of 197062088461 in words is "one hundred ninety-seven billion, sixty-two million, eighty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •