Base | Representation |
---|---|
bin | 10111110101001… |
… | …11111000000100 |
3 | 111221011211122120 |
4 | 23322213320010 |
5 | 402134321220 |
6 | 31500525540 |
7 | 4645160400 |
oct | 1372477004 |
9 | 457154576 |
10 | 199917060 |
11 | a2936712 |
12 | 56b508b0 |
13 | 32558625 |
14 | 1c7a0100 |
15 | 1283ea40 |
hex | bea7e04 |
199917060 has 144 divisors (see below), whose sum is σ = 663961536. Its totient is φ = 44798208.
The previous prime is 199917041. The next prime is 199917061. The reversal of 199917060 is 60719991.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (199917061) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 155179 + ... + 156461.
It is an arithmetic number, because the mean of its divisors is an integer number (4610844).
Almost surely, 2199917060 is an apocalyptic number.
199917060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 199917060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (331980768).
199917060 is an abundant number, since it is smaller than the sum of its proper divisors (464044476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199917060 is a wasteful number, since it uses less digits than its factorization.
199917060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362 (or 1353 counting only the distinct ones).
The product of its (nonzero) digits is 30618, while the sum is 42.
The square root of 199917060 is about 14139.2029478327. The cubic root of 199917060 is about 584.7226971216.
The spelling of 199917060 in words is "one hundred ninety-nine million, nine hundred seventeen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •