Base | Representation |
---|---|
bin | 1011011110100101110… |
… | …1000011100001010001 |
3 | 200211222112012220020000 |
4 | 2313221131003201101 |
5 | 11212321200024431 |
6 | 230330555040213 |
7 | 20150362231635 |
oct | 2675135034121 |
9 | 624875186200 |
10 | 197190236241 |
11 | 7669a825099 |
12 | 32272740069 |
13 | 15797183a7b |
14 | 9788c78dc5 |
15 | 51e195b9e6 |
hex | 2de9743851 |
197190236241 has 40 divisors (see below), whose sum is σ = 298856308608. Its totient is φ = 129548160000.
The previous prime is 197190236231. The next prime is 197190236261. The reversal of 197190236241 is 142632091791.
197190236241 is a `hidden beast` number, since 1 + 9 + 7 + 19 + 0 + 2 + 3 + 624 + 1 = 666.
197190236241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 197190236241 - 25 = 197190236209 is a prime.
It is a super-3 number, since 3×1971902362413 (a number of 35 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (197190236231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 14664081 + ... + 14677521.
Almost surely, 2197190236241 is an apocalyptic number.
It is an amenable number.
197190236241 is a deficient number, since it is larger than the sum of its proper divisors (101666072367).
197190236241 is a wasteful number, since it uses less digits than its factorization.
197190236241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16075 (or 16066 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 45.
The spelling of 197190236241 in words is "one hundred ninety-seven billion, one hundred ninety million, two hundred thirty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •