Base | Representation |
---|---|
bin | 100110010110011000010… |
… | …1101110110111011000000 |
3 | 200122212201002022220210002 |
4 | 1030230300231312323000 |
5 | 1142323440000400000 |
6 | 15113202345255132 |
7 | 1052540622330164 |
oct | 114546055667300 |
9 | 20585632286702 |
10 | 5270742200000 |
11 | 1752344622662 |
12 | 711608a944a8 |
13 | 2c304b524184 |
14 | 143168c80ca4 |
15 | 921865128d5 |
hex | 4cb30b76ec0 |
5270742200000 has 168 divisors, whose sum is σ = 13377121403184. Its totient is φ = 2059263360000.
The previous prime is 5270742199999. The next prime is 5270742200039. The reversal of 5270742200000 is 22470725.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8293562 + ... + 8906438.
It is an arithmetic number, because the mean of its divisors is an integer number (79625722638).
Almost surely, 25270742200000 is an apocalyptic number.
5270742200000 is a gapful number since it is divisible by the number (50) 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 5270742200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6688560701592).
5270742200000 is an abundant number, since it is smaller than the sum of its proper divisors (8106379203184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5270742200000 is an frugal number, since it uses more digits than its factorization.
5270742200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612957 (or 612927 counting only the distinct ones).
The product of its (nonzero) digits is 7840, while the sum is 29.
Adding to 5270742200000 its reverse (22470725), we get a palindrome (5270764670725).
The spelling of 5270742200000 in words is "five trillion, two hundred seventy billion, seven hundred forty-two million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •