Base | Representation |
---|---|
bin | 1011011100000001110… |
… | …0001111001001001001 |
3 | 200210012120110210101001 |
4 | 2313000130033021021 |
5 | 11204414022441344 |
6 | 230134415055001 |
7 | 20124335523436 |
oct | 2670034171111 |
9 | 623176423331 |
10 | 196502155849 |
11 | 7637738710a |
12 | 32100211461 |
13 | 156b7758bcc |
14 | 9721724b8d |
15 | 51a1340ed4 |
hex | 2dc070f249 |
196502155849 has 8 divisors (see below), whose sum is σ = 201872389248. Its totient is φ = 191135046960.
The previous prime is 196502155847. The next prime is 196502155873. The reversal of 196502155849 is 948551205691.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 196502155849 - 21 = 196502155847 is a prime.
It is a super-2 number, since 2×1965021558492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 196502155849.
It is not an unprimeable number, because it can be changed into a prime (196502155841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 653347 + ... + 905464.
It is an arithmetic number, because the mean of its divisors is an integer number (25234048656).
Almost surely, 2196502155849 is an apocalyptic number.
It is an amenable number.
196502155849 is a deficient number, since it is larger than the sum of its proper divisors (5370233399).
196502155849 is a wasteful number, since it uses less digits than its factorization.
196502155849 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1562255.
The product of its (nonzero) digits is 3888000, while the sum is 55.
The spelling of 196502155849 in words is "one hundred ninety-six billion, five hundred two million, one hundred fifty-five thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •