Base | Representation |
---|---|
bin | 10111011100110… |
… | …00110001100110 |
3 | 111201010212200020 |
4 | 23232120301212 |
5 | 400324200403 |
6 | 31304100010 |
7 | 4606001010 |
oct | 1356306146 |
9 | 451125606 |
10 | 196709478 |
11 | a1045819 |
12 | 55a64606 |
13 | 319a4654 |
14 | 1c1a71b0 |
15 | 12409453 |
hex | bb98c66 |
196709478 has 64 divisors (see below), whose sum is σ = 471536640. Its totient is φ = 53488512.
The previous prime is 196709459. The next prime is 196709483. The reversal of 196709478 is 874907691.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 196709478.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 259476 + ... + 260232.
It is an arithmetic number, because the mean of its divisors is an integer number (7367760).
Almost surely, 2196709478 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 196709478, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235768320).
196709478 is an abundant number, since it is smaller than the sum of its proper divisors (274827162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196709478 is a wasteful number, since it uses less digits than its factorization.
196709478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061.
The product of its (nonzero) digits is 762048, while the sum is 51.
The square root of 196709478 is about 14025.3156114221. The cubic root of 196709478 is about 581.5786146886.
The spelling of 196709478 in words is "one hundred ninety-six million, seven hundred nine thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •