Base | Representation |
---|---|
bin | 1011011010111110011… |
… | …0011011101011101101 |
3 | 200202110212211021112111 |
4 | 2312233212123223231 |
5 | 11203324210202411 |
6 | 230050403204021 |
7 | 20114335134154 |
oct | 2665746335355 |
9 | 622425737474 |
10 | 196219615981 |
11 | 76241948794 |
12 | 32041676611 |
13 | 1567106245c |
14 | 96d5db859b |
15 | 5186630721 |
hex | 2daf99baed |
196219615981 has 4 divisors (see below), whose sum is σ = 196221608992. Its totient is φ = 196217622972.
The previous prime is 196219615919. The next prime is 196219616017. The reversal of 196219615981 is 189516912691.
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: 189516912691 = 269 ⋅704523839.
It is a cyclic number.
It is not a de Polignac number, because 196219615981 - 219 = 196219091693 is a prime.
It is a super-2 number, since 2×1962196159812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196219618981) 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, 840705 + ... + 1048438.
It is an arithmetic number, because the mean of its divisors is an integer number (49055402248).
Almost surely, 2196219615981 is an apocalyptic number.
It is an amenable number.
196219615981 is a deficient number, since it is larger than the sum of its proper divisors (1993011).
196219615981 is a wasteful number, since it uses less digits than its factorization.
196219615981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1993010.
The product of its digits is 2099520, while the sum is 58.
The spelling of 196219615981 in words is "one hundred ninety-six billion, two hundred nineteen million, six hundred fifteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •