Base | Representation |
---|---|
bin | 1011100000101011110… |
… | …1000011000000000000 |
3 | 200220102200210012202120 |
4 | 2320022331003000000 |
5 | 11214444040131343 |
6 | 230502433244240 |
7 | 20200325365536 |
oct | 2701275030000 |
9 | 626380705676 |
10 | 197752270848 |
11 | 76959002000 |
12 | 323aaa03680 |
13 | 15856748c22 |
14 | 97dd77c156 |
15 | 5225e7a683 |
hex | 2e0af43000 |
197752270848 has 416 divisors, whose sum is σ = 590563498752. Its totient is φ = 58839531520.
The previous prime is 197752270843. The next prime is 197752270897. The reversal of 197752270848 is 848072257791.
It is a junction number, because it is equal to n+sod(n) for n = 197752270791 and 197752270800.
It is not an unprimeable number, because it can be changed into a prime (197752270843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1750020040 + ... + 1750020152.
Almost surely, 2197752270848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 197752270848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (295281749376).
197752270848 is an abundant number, since it is smaller than the sum of its proper divisors (392811227904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197752270848 is a wasteful number, since it uses less digits than its factorization.
197752270848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280 (or 236 counting only the distinct ones).
The product of its (nonzero) digits is 15805440, while the sum is 60.
The spelling of 197752270848 in words is "one hundred ninety-seven billion, seven hundred fifty-two million, two hundred seventy thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •