Base | Representation |
---|---|
bin | 10111011011001… |
… | …01111100010010 |
3 | 111200202022001200 |
4 | 23231211330102 |
5 | 400301020031 |
6 | 31255412030 |
7 | 4604142663 |
oct | 1355457422 |
9 | 450668050 |
10 | 196501266 |
11 | a0a13345 |
12 | 55984016 |
13 | 31930950 |
14 | 1c15136a |
15 | 123b78e6 |
hex | bb65f12 |
196501266 has 96 divisors (see below), whose sum is σ = 496274688. Its totient is φ = 55641600.
The previous prime is 196501247. The next prime is 196501273. The reversal of 196501266 is 662105691.
196501266 is a `hidden beast` number, since 1 + 96 + 501 + 2 + 66 = 666.
It is a super-2 number, since 2×1965012662 = 77225495079205512, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 196501266.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 186441 + ... + 187491.
It is an arithmetic number, because the mean of its divisors is an integer number (5169528).
Almost surely, 2196501266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 196501266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248137344).
196501266 is an abundant number, since it is smaller than the sum of its proper divisors (299773422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196501266 is a wasteful number, since it uses less digits than its factorization.
196501266 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1136 (or 1133 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 196501266 is about 14017.8909255280. The cubic root of 196501266 is about 581.3733468370.
The spelling of 196501266 in words is "one hundred ninety-six million, five hundred one thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •