Base | Representation |
---|---|
bin | 1011011101100111100… |
… | …0000111100111100001 |
3 | 200211022022110102001201 |
4 | 2313121320013213201 |
5 | 11211302244123312 |
6 | 230245021401201 |
7 | 20141036664310 |
oct | 2673170074741 |
9 | 624268412051 |
10 | 196928895457 |
11 | 76576255978 |
12 | 321bb109201 |
13 | 15754ca0458 |
14 | 976228a277 |
15 | 51c8a37557 |
hex | 2dd9e079e1 |
196928895457 has 4 divisors (see below), whose sum is σ = 225061594816. Its totient is φ = 168796196100.
The previous prime is 196928895421. The next prime is 196928895463. The reversal of 196928895457 is 754598829691.
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, and also an emirpimes, since its reverse is a distinct semiprime: 754598829691 = 7 ⋅107799832813.
It is a de Polignac number, because none of the positive numbers 2k-196928895457 is a prime.
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 196928895457.
It is not an unprimeable number, because it can be changed into a prime (196928895467) 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, 14066349669 + ... + 14066349682.
It is an arithmetic number, because the mean of its divisors is an integer number (56265398704).
Almost surely, 2196928895457 is an apocalyptic number.
It is an amenable number.
196928895457 is a deficient number, since it is larger than the sum of its proper divisors (28132699359).
196928895457 is an equidigital number, since it uses as much as digits as its factorization.
196928895457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28132699358.
The product of its digits is 391910400, while the sum is 73.
The spelling of 196928895457 in words is "one hundred ninety-six billion, nine hundred twenty-eight million, eight hundred ninety-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •