Base | Representation |
---|---|
bin | 1011011110011110000… |
… | …0100000111111001100 |
3 | 200211220020210020112201 |
4 | 2313213200200333030 |
5 | 11212234320321230 |
6 | 230323431211244 |
7 | 20146514566204 |
oct | 2674740407714 |
9 | 624806706481 |
10 | 197157588940 |
11 | 76683356754 |
12 | 32263816b24 |
13 | 15790492b40 |
14 | 97847bb404 |
15 | 51ddb5d5ca |
hex | 2de7820fcc |
197157588940 has 24 divisors (see below), whose sum is σ = 445879470960. Its totient is φ = 72796648128.
The previous prime is 197157588919. The next prime is 197157588949. The reversal of 197157588940 is 49885751791.
It is a super-2 number, since 2×1971575889402 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (64) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (197157588949) 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, 379148950 + ... + 379149469.
It is an arithmetic number, because the mean of its divisors is an integer number (18578311290).
Almost surely, 2197157588940 is an apocalyptic number.
197157588940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
197157588940 is an abundant number, since it is smaller than the sum of its proper divisors (248721882020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197157588940 is a wasteful number, since it uses less digits than its factorization.
197157588940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758298441 (or 758298439 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 64.
The spelling of 197157588940 in words is "one hundred ninety-seven billion, one hundred fifty-seven million, five hundred eighty-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •