Base | Representation |
---|---|
bin | 10111101001101100010100… |
… | …00011011010001111101000 |
3 | 20211011010002120011002211011 |
4 | 23310312022003122033220 |
5 | 23304113113213341000 |
6 | 302341033151313304 |
7 | 13645414101241351 |
oct | 1364661203321750 |
9 | 224133076132734 |
10 | 52010075137000 |
11 | 15632392573482 |
12 | 59bba98b1b834 |
13 | 23036b53c1576 |
14 | cbb4301b8d28 |
15 | 602d7c3dd2ba |
hex | 2f4d8a0da3e8 |
52010075137000 has 64 divisors (see below), whose sum is σ = 121706316622800. Its totient is φ = 20803561542400.
The previous prime is 52010075136991. The next prime is 52010075137021. The reversal of 52010075137000 is 73157001025.
52010075137000 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 8 ways, for example, as 16954415645476 + 35055659491524 = 4117574^2 + 5920782^2 .
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 45666474 + ... + 46791526.
Almost surely, 252010075137000 is an apocalyptic number.
52010075137000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52010075137000 is an abundant number, since it is smaller than the sum of its proper divisors (69696241485800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52010075137000 is a wasteful number, since it uses less digits than its factorization.
52010075137000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171303 (or 1171289 counting only the distinct ones).
The product of its (nonzero) digits is 7350, while the sum is 31.
The spelling of 52010075137000 in words is "fifty-two trillion, ten billion, seventy-five million, one hundred thirty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •