Base | Representation |
---|---|
bin | 10111110000110101101110… |
… | …00101001011110111101000 |
3 | 20212000120221122202022000121 |
4 | 23320122313011023313220 |
5 | 23322124024242304000 |
6 | 303045524502213024 |
7 | 14002226364553540 |
oct | 1370326705136750 |
9 | 225016848668017 |
10 | 52255643713000 |
11 | 15717548635242 |
12 | 5a3b5b1424174 |
13 | 23208bc367280 |
14 | cc9288252320 |
15 | 609451162b1a |
hex | 2f86b714bde8 |
52255643713000 has 256 divisors, whose sum is σ = 150536382796800. Its totient is φ = 16533640166400.
The previous prime is 52255643712991. The next prime is 52255643713043. The reversal of 52255643713000 is 31734655225.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 350002366 + ... + 350151634.
It is an arithmetic number, because the mean of its divisors is an integer number (588032745300).
Almost surely, 252255643713000 is an apocalyptic number.
52255643713000 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 52255643713000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75268191398400).
52255643713000 is an abundant number, since it is smaller than the sum of its proper divisors (98280739083800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52255643713000 is a wasteful number, since it uses less digits than its factorization.
52255643713000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153157 (or 153143 counting only the distinct ones).
The product of its (nonzero) digits is 756000, while the sum is 43.
The spelling of 52255643713000 in words is "fifty-two trillion, two hundred fifty-five billion, six hundred forty-three million, seven hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •