Base | Representation |
---|---|
bin | 10111011010000… |
… | …00011011111000 |
3 | 111200110111022211 |
4 | 23231000123320 |
5 | 400231111030 |
6 | 31252224504 |
7 | 4602633046 |
oct | 1355003370 |
9 | 450414284 |
10 | 196347640 |
11 | a0918985 |
12 | 5590b134 |
13 | 318a8a48 |
14 | 1c111396 |
15 | 1238712a |
hex | bb406f8 |
196347640 has 16 divisors (see below), whose sum is σ = 441782280. Its totient is φ = 78539040.
The previous prime is 196347629. The next prime is 196347667. The reversal of 196347640 is 46743691.
196347640 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 4908691 = 196347640 / (1 + 9 + 6 + 3 + 4 + 7 + 6 + 4 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 196347593 and 196347602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2454306 + ... + 2454385.
Almost surely, 2196347640 is an apocalyptic number.
196347640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
196347640 is an abundant number, since it is smaller than the sum of its proper divisors (245434640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196347640 is a wasteful number, since it uses less digits than its factorization.
196347640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4908702 (or 4908698 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 40.
The square root of 196347640 is about 14012.4102138069. The cubic root of 196347640 is about 581.2218001504.
The spelling of 196347640 in words is "one hundred ninety-six million, three hundred forty-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •