Base | Representation |
---|---|
bin | 1111101111111000101… |
… | …0011011000101101100 |
3 | 221212100020112121100110 |
4 | 3323332022123011230 |
5 | 13413042320230422 |
6 | 324142342500020 |
7 | 25355351025000 |
oct | 3737612330554 |
9 | 855306477313 |
10 | 270552117612 |
11 | a4816687417 |
12 | 44527434610 |
13 | 1c688c68b2a |
14 | d148178700 |
15 | 708729560c |
hex | 3efe29b16c |
270552117612 has 96 divisors (see below), whose sum is σ = 737491955200. Its totient is φ = 77164557120.
The previous prime is 270552117611. The next prime is 270552117613. The reversal of 270552117612 is 216711255072.
It is an interprime number because it is at equal distance from previous prime (270552117611) and next prime (270552117613).
It is not an unprimeable number, because it can be changed into a prime (270552117611) 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 31 ways as a sum of consecutive naturals, for example, 2292678 + ... + 2407794.
Almost surely, 2270552117612 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 270552117612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (368745977600).
270552117612 is an abundant number, since it is smaller than the sum of its proper divisors (466939837588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270552117612 is a wasteful number, since it uses less digits than its factorization.
270552117612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115716 (or 115700 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 39.
The spelling of 270552117612 in words is "two hundred seventy billion, five hundred fifty-two million, one hundred seventeen thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •