Base | Representation |
---|---|
bin | 1111101110010111110… |
… | …1101101010101100100 |
3 | 221211021221121100211101 |
4 | 3323211331231111210 |
5 | 13411224402200200 |
6 | 324034201045444 |
7 | 25342321141303 |
oct | 3734575552544 |
9 | 854257540741 |
10 | 270146131300 |
11 | a46284a2941 |
12 | 44433486884 |
13 | 1c622b0c846 |
14 | d10a29643a |
15 | 70617ed26a |
hex | 3ee5f6d564 |
270146131300 has 108 divisors (see below), whose sum is σ = 623400616300. Its totient is φ = 101592391680.
The previous prime is 270146131279. The next prime is 270146131391. The reversal of 270146131300 is 3131641072.
It can be written as a sum of positive squares in 18 ways, for example, as 6174187776 + 263971943524 = 78576^2 + 513782^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 29849176 + ... + 29858224.
Almost surely, 2270146131300 is an apocalyptic number.
270146131300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 270146131300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (311700308150).
270146131300 is an abundant number, since it is smaller than the sum of its proper divisors (353254485000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270146131300 is a wasteful number, since it uses less digits than its factorization.
270146131300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10130 (or 10106 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 270146131300 its reverse (3131641072), we get a palindrome (273277772372).
The spelling of 270146131300 in words is "two hundred seventy billion, one hundred forty-six million, one hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •