Base | Representation |
---|---|
bin | 1011011011111010110… |
… | …1110001110110111100 |
3 | 200210010112222200111102 |
4 | 2312332231301312330 |
5 | 11204334114400220 |
6 | 230131502312232 |
7 | 20123534434304 |
oct | 2667655616674 |
9 | 623115880442 |
10 | 196473200060 |
11 | 76361aaa205 |
12 | 320b2588678 |
13 | 156b175b2c7 |
14 | 971b948604 |
15 | 519da21775 |
hex | 2dbeb71dbc |
196473200060 has 48 divisors (see below), whose sum is σ = 434381636640. Its totient is φ = 74440581120.
The previous prime is 196473200051. The next prime is 196473200129. The reversal of 196473200060 is 60002374691.
196473200060 is digitally balanced in base 3, 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 (38).
It is a junction number, because it is equal to n+sod(n) for n = 196473199987 and 196473200023.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2422892 + ... + 2502668.
It is an arithmetic number, because the mean of its divisors is an integer number (9049617430).
Almost surely, 2196473200060 is an apocalyptic number.
196473200060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
196473200060 is an abundant number, since it is smaller than the sum of its proper divisors (237908436580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196473200060 is a wasteful number, since it uses less digits than its factorization.
196473200060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86286 (or 86284 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 38.
The spelling of 196473200060 in words is "one hundred ninety-six billion, four hundred seventy-three million, two hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •