Base | Representation |
---|---|
bin | 1011100110111110001… |
… | …0111000000111111000 |
3 | 201001210022101010120221 |
4 | 2321233202320013320 |
5 | 11231423104044433 |
6 | 231342121225424 |
7 | 20260210154500 |
oct | 2715742700770 |
9 | 631708333527 |
10 | 199439909368 |
11 | 776446a1887 |
12 | 327a0032274 |
13 | 15a65287abb |
14 | 991d966a00 |
15 | 52c41db72d |
hex | 2e6f8b81f8 |
199439909368 has 96 divisors (see below), whose sum is σ = 445503564000. Its totient is φ = 83434848000.
The previous prime is 199439909363. The next prime is 199439909393. The reversal of 199439909368 is 863909934991.
It is a junction number, because it is equal to n+sod(n) for n = 199439909297 and 199439909306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (199439909363) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2775558 + ... + 2846506.
It is an arithmetic number, because the mean of its divisors is an integer number (4640662125).
Almost surely, 2199439909368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 199439909368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222751782000).
199439909368 is an abundant number, since it is smaller than the sum of its proper divisors (246063654632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199439909368 is a wasteful number, since it uses less digits than its factorization.
199439909368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71141 (or 71130 counting only the distinct ones).
The product of its (nonzero) digits is 102036672, while the sum is 70.
The spelling of 199439909368 in words is "one hundred ninety-nine billion, four hundred thirty-nine million, nine hundred nine thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •