Base | Representation |
---|---|
bin | 1011000100110101101… |
… | …0110000000100000000 |
3 | 200012010202112102001121 |
4 | 2301031122300010000 |
5 | 11104142004404024 |
6 | 223225013242024 |
7 | 16514152243402 |
oct | 2611532600400 |
9 | 605122472047 |
10 | 190277419264 |
11 | 73772708409 |
12 | 30a63633314 |
13 | 14c34c5481a |
14 | 92d0b34b72 |
15 | 4e39b148e4 |
hex | 2c4d6b0100 |
190277419264 has 81 divisors (see below), whose sum is σ = 384536446077. Its totient is φ = 93969672192.
The previous prime is 190277419253. The next prime is 190277419313. The reversal of 190277419264 is 462914772091.
It is a happy number.
The square root of 190277419264 is 436208.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 111769862400 + 78507556864 = 334320^2 + 280192^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 956167837 + ... + 956168035.
Almost surely, 2190277419264 is an apocalyptic number.
190277419264 is the 436208-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 190277419264
190277419264 is an abundant number, since it is smaller than the sum of its proper divisors (194259026813).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190277419264 is an frugal number, since it uses more digits than its factorization.
190277419264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688 (or 338 counting only the distinct ones).
The product of its (nonzero) digits is 1524096, while the sum is 52.
The spelling of 190277419264 in words is "one hundred ninety billion, two hundred seventy-seven million, four hundred nineteen thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •