Base | Representation |
---|---|
bin | 1011100111111110011… |
… | …1001011110010101000 |
3 | 201002111002121102200201 |
4 | 2321333213023302220 |
5 | 11233001111131320 |
6 | 231424551041544 |
7 | 20266662343213 |
oct | 2717747136250 |
9 | 632432542621 |
10 | 199709473960 |
11 | 77772878737 |
12 | 328563702b4 |
13 | 15aa908a689 |
14 | 994769677a |
15 | 52dcbd770a |
hex | 2e7f9cbca8 |
199709473960 has 32 divisors (see below), whose sum is σ = 452362077000. Its totient is φ = 79347654400.
The previous prime is 199709473949. The next prime is 199709473969. The reversal of 199709473960 is 69374907991.
It can be written as a sum of positive squares in 4 ways, for example, as 116189629956 + 83519844004 = 340866^2 + 288998^2 .
It is a junction number, because it is equal to n+sod(n) for n = 199709473892 and 199709473901.
It is not an unprimeable number, because it can be changed into a prime (199709473969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16748191 + ... + 16760110.
Almost surely, 2199709473960 is an apocalyptic number.
199709473960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
199709473960 is an abundant number, since it is smaller than the sum of its proper divisors (252652603040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199709473960 is a wasteful number, since it uses less digits than its factorization.
199709473960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33508461 (or 33508457 counting only the distinct ones).
The product of its (nonzero) digits is 23147208, while the sum is 64.
The spelling of 199709473960 in words is "one hundred ninety-nine billion, seven hundred nine million, four hundred seventy-three thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •