Base | Representation |
---|---|
bin | 10111111011000000000010… |
… | …11100111101001011000000 |
3 | 20220020222010211102212011021 |
4 | 23331200001130331023000 |
5 | 23343334044123343331 |
6 | 303514145402155224 |
7 | 14036366403451642 |
oct | 1375400134751300 |
9 | 226228124385137 |
10 | 52604783809216 |
11 | 15841622069101 |
12 | 5a971ab7b2b14 |
13 | 23477c0a3a792 |
14 | cdc129804892 |
15 | 61358795a211 |
hex | 2fd80173d2c0 |
52604783809216 has 28 divisors (see below), whose sum is σ = 109881703025080. Its totient is φ = 24918055488000.
The previous prime is 52604783809211. The next prime is 52604783809261. The reversal of 52604783809216 is 61290838740625.
It is a super-2 number, since 2×526047838092162 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52604783809211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21630255285 + ... + 21630257716.
It is an arithmetic number, because the mean of its divisors is an integer number (3924346536610).
It is a 2-persistent number, because it is pandigital, and so is 2⋅52604783809216 = 105209567618432, but 3⋅52604783809216 = 157814351427648 is not.
Almost surely, 252604783809216 is an apocalyptic number.
It is an amenable number.
52604783809216 is an abundant number, since it is smaller than the sum of its proper divisors (57276919215864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52604783809216 is a wasteful number, since it uses less digits than its factorization.
52604783809216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43260513032 (or 43260513022 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 61.
The spelling of 52604783809216 in words is "fifty-two trillion, six hundred four billion, seven hundred eighty-three million, eight hundred nine thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.292 sec. • engine limits •