Base | Representation |
---|---|
bin | 10111011000011… |
… | …01000001011010 |
3 | 111200001210110012 |
4 | 23230031001122 |
5 | 400202341200 |
6 | 31243521522 |
7 | 4601065064 |
oct | 1354150132 |
9 | 450053405 |
10 | 196137050 |
11 | a079473a |
12 | 558292a2 |
13 | 31833c35 |
14 | 1c098734 |
15 | 12344a35 |
hex | bb0d05a |
196137050 has 12 divisors (see below), whose sum is σ = 364815006. Its totient is φ = 78454800.
The previous prime is 196137049. The next prime is 196137079. The reversal of 196137050 is 50731691.
It can be written as a sum of positive squares in 3 ways, for example, as 127396369 + 68740681 = 11287^2 + 8291^2 .
It is a junction number, because it is equal to n+sod(n) for n = 196136998 and 196137016.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 1961321 + ... + 1961420.
Almost surely, 2196137050 is an apocalyptic number.
196137050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
196137050 is a deficient number, since it is larger than the sum of its proper divisors (168677956).
196137050 is a wasteful number, since it uses less digits than its factorization.
196137050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3922753 (or 3922748 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 196137050 is about 14004.8937875301. The cubic root of 196137050 is about 581.0139319626.
The spelling of 196137050 in words is "one hundred ninety-six million, one hundred thirty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •