Base | Representation |
---|---|
bin | 1011100101111000010… |
… | …0111110101000111001 |
3 | 201001000212221122011000 |
4 | 2321132010332220321 |
5 | 11230323043442230 |
6 | 231253052155213 |
7 | 20250021241440 |
oct | 2713604765071 |
9 | 631025848130 |
10 | 199146859065 |
11 | 77504234850 |
12 | 32719a68b09 |
13 | 15a1965135b |
14 | 98d2a81d57 |
15 | 52a8601b60 |
hex | 2e5e13ea39 |
199146859065 has 256 divisors, whose sum is σ = 475982438400. Its totient is φ = 76490956800.
The previous prime is 199146859063. The next prime is 199146859097. The reversal of 199146859065 is 560958641991.
It is not a de Polignac number, because 199146859065 - 21 = 199146859063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 199146858993 and 199146859011.
It is not an unprimeable number, because it can be changed into a prime (199146859063) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 8085409 + ... + 8110001.
It is an arithmetic number, because the mean of its divisors is an integer number (1859306400).
Almost surely, 2199146859065 is an apocalyptic number.
199146859065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
199146859065 is an abundant number, since it is smaller than the sum of its proper divisors (276835579335).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199146859065 is a wasteful number, since it uses less digits than its factorization.
199146859065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24685 (or 24679 counting only the distinct ones).
The product of its (nonzero) digits is 20995200, while the sum is 63.
The spelling of 199146859065 in words is "one hundred ninety-nine billion, one hundred forty-six million, eight hundred fifty-nine thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •