Base | Representation |
---|---|
bin | 10011001111011101001… |
… | …01010100000101000110 |
3 | 2100012111110220210100100 |
4 | 21213232211110011012 |
5 | 41312444441132040 |
6 | 1223415321224530 |
7 | 65523325461141 |
oct | 11475645240506 |
9 | 2305443823310 |
10 | 661132755270 |
11 | 235426228439 |
12 | a8170032146 |
13 | 4a462c96490 |
14 | 23ddb361058 |
15 | 122e6c76b30 |
hex | 99ee954146 |
661132755270 has 48 divisors (see below), whose sum is σ = 1851171718032. Its totient is φ = 162740370240.
The previous prime is 661132755247. The next prime is 661132755271. The reversal of 661132755270 is 72557231166.
It is a happy number.
661132755270 is a `hidden beast` number, since 6 + 6 + 1 + 1 + 3 + 27 + 552 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (661132755271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 282534196 + ... + 282536535.
It is an arithmetic number, because the mean of its divisors is an integer number (38566077459).
Almost surely, 2661132755270 is an apocalyptic number.
661132755270 is an abundant number, since it is smaller than the sum of its proper divisors (1190038962762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
661132755270 is a wasteful number, since it uses less digits than its factorization.
661132755270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565070757 (or 565070754 counting only the distinct ones).
The product of its (nonzero) digits is 529200, while the sum is 45.
The spelling of 661132755270 in words is "six hundred sixty-one billion, one hundred thirty-two million, seven hundred fifty-five thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •