Base | Representation |
---|---|
bin | 101100110010100110001000… |
… | …110000110111101111111111 |
3 | 221211111011010100222001220002 |
4 | 230302212020300313233333 |
5 | 201310000001200344204 |
6 | 1534544222503544515 |
7 | 56331061602410423 |
oct | 5462461060675777 |
9 | 854434110861802 |
10 | 196990969543679 |
11 | 57849445844133 |
12 | 1a11620515b13b |
13 | 85bc2268a70cc |
14 | 36905b1668b83 |
15 | 17b92c1b5491e |
hex | b32988c37bff |
196990969543679 has 8 divisors (see below), whose sum is σ = 197818924472400. Its totient is φ = 196163101929600.
The previous prime is 196990969543661. The next prime is 196990969543681. The reversal of 196990969543679 is 976345969099691.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 196990969543679 - 212 = 196990969539583 is a prime.
It is a super-4 number, since 4×1969909695436794 (a number of 58 digits) contains 4444 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 (196990969593679) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17305004 + ... + 26333345.
It is an arithmetic number, because the mean of its divisors is an integer number (24727365559050).
Almost surely, 2196990969543679 is an apocalyptic number.
196990969543679 is a deficient number, since it is larger than the sum of its proper divisors (827954928721).
196990969543679 is a wasteful number, since it uses less digits than its factorization.
196990969543679 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43657321.
The product of its (nonzero) digits is 48212327520, while the sum is 92.
The spelling of 196990969543679 in words is "one hundred ninety-six trillion, nine hundred ninety billion, nine hundred sixty-nine million, five hundred forty-three thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •