Base | Representation |
---|---|
bin | 10111010101000… |
… | …10000110101010 |
3 | 111122020112201100 |
4 | 23222202012222 |
5 | 400044332424 |
6 | 31230302230 |
7 | 4564262232 |
oct | 1352420652 |
9 | 448215640 |
10 | 195699114 |
11 | a0515706 |
12 | 55657976 |
13 | 3170c7c0 |
14 | 1bdc2cc2 |
15 | 122a9dc9 |
hex | baa21aa |
195699114 has 48 divisors (see below), whose sum is σ = 458476200. Its totient is φ = 59971968.
The previous prime is 195699103. The next prime is 195699131. The reversal of 195699114 is 411996591.
It can be written as a sum of positive squares in 4 ways, for example, as 52490025 + 143209089 = 7245^2 + 11967^2 .
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 195699114.
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 23 ways as a sum of consecutive naturals, for example, 61392 + ... + 64500.
Almost surely, 2195699114 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 195699114, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229238100).
195699114 is an abundant number, since it is smaller than the sum of its proper divisors (262777086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195699114 is a wasteful number, since it uses less digits than its factorization.
195699114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3399 (or 3396 counting only the distinct ones).
The product of its digits is 87480, while the sum is 45.
The square root of 195699114 is about 13989.2499441535. The cubic root of 195699114 is about 580.5811792361.
The spelling of 195699114 in words is "one hundred ninety-five million, six hundred ninety-nine thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •