Base | Representation |
---|---|
bin | 1011011011001011011… |
… | …1110110000001011001 |
3 | 200202121201010021122221 |
4 | 2312302313312001121 |
5 | 11203432233340321 |
6 | 230100043544041 |
7 | 20115602552563 |
oct | 2666267660131 |
9 | 622551107587 |
10 | 196274511961 |
11 | 7626a932970 |
12 | 32057b2b021 |
13 | 1567c543198 |
14 | 96dd3c8333 |
15 | 518b375e41 |
hex | 2db2df6059 |
196274511961 has 4 divisors (see below), whose sum is σ = 214117649424. Its totient is φ = 178431374500.
The previous prime is 196274511907. The next prime is 196274511973. The reversal of 196274511961 is 169115472691.
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 196274511961 - 219 = 196273987673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 196274511899 and 196274511908.
It is not an unprimeable number, because it can be changed into a prime (196274511061) 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, 8921568715 + ... + 8921568736.
It is an arithmetic number, because the mean of its divisors is an integer number (53529412356).
Almost surely, 2196274511961 is an apocalyptic number.
196274511961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
196274511961 is a deficient number, since it is larger than the sum of its proper divisors (17843137463).
196274511961 is a wasteful number, since it uses less digits than its factorization.
196274511961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17843137462.
The product of its digits is 816480, while the sum is 52.
The spelling of 196274511961 in words is "one hundred ninety-six billion, two hundred seventy-four million, five hundred eleven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •