Base | Representation |
---|---|
bin | 1111101111110000110… |
… | …0010010001100100010 |
3 | 221212020221022122112200 |
4 | 3323330030102030202 |
5 | 13413010334113132 |
6 | 324135202034030 |
7 | 25354466665002 |
oct | 3737414221442 |
9 | 855227278480 |
10 | 270519051042 |
11 | a47a9a51a79 |
12 | 44518348916 |
13 | 1c68215c106 |
14 | d143a0c002 |
15 | 7084412d7c |
hex | 3efc312322 |
270519051042 has 12 divisors (see below), whose sum is σ = 586124610630. Its totient is φ = 90173017008.
The previous prime is 270519051037. The next prime is 270519051053. The reversal of 270519051042 is 240150915072.
270519051042 is a `hidden beast` number, since 2 + 7 + 0 + 51 + 90 + 510 + 4 + 2 = 666.
270519051042 is digitally balanced in base 2, 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 only one way, i.e., 167599353321 + 102919697721 = 409389^2 + 320811^2 .
It is a junction number, because it is equal to n+sod(n) for n = 270519050988 and 270519051006.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 7514418067 + ... + 7514418102.
Almost surely, 2270519051042 is an apocalyptic number.
270519051042 is an abundant number, since it is smaller than the sum of its proper divisors (315605559588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270519051042 is a wasteful number, since it uses less digits than its factorization.
270519051042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15028836177 (or 15028836174 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The spelling of 270519051042 in words is "two hundred seventy billion, five hundred nineteen million, fifty-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •