Base | Representation |
---|---|
bin | 1011101000001011000… |
… | …1100001001100010000 |
3 | 201002121210102011220201 |
4 | 2322002301201030100 |
5 | 11233103200432304 |
6 | 231434123544544 |
7 | 20301205234024 |
oct | 2720261411420 |
9 | 632553364821 |
10 | 199762514704 |
11 | 7779a805a65 |
12 | 3287008b154 |
13 | 15ab706bb2c |
14 | 9950742384 |
15 | 52e26b33a4 |
hex | 2e82c61310 |
199762514704 has 45 divisors (see below), whose sum is σ = 400950350463. Its totient is φ = 96412046976.
The previous prime is 199762514641. The next prime is 199762514723. The reversal of 199762514704 is 407415267991.
The square root of 199762514704 is 446948.
It is a perfect power (a square), and thus also a powerful number.
199762514704 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 85486064400 + 114276450304 = 292380^2 + 338048^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 51844042 + ... + 51847894.
Almost surely, 2199762514704 is an apocalyptic number.
199762514704 is the 446948-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 199762514704
199762514704 is an abundant number, since it is smaller than the sum of its proper divisors (201187835759).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199762514704 is an frugal number, since it uses more digits than its factorization.
199762514704 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7772 (or 3884 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 55.
The spelling of 199762514704 in words is "one hundred ninety-nine billion, seven hundred sixty-two million, five hundred fourteen thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •