Base | Representation |
---|---|
bin | 10111101010001000010000… |
… | …11010011111111010011000 |
3 | 20211012112211021111011120222 |
4 | 23311010020122133322120 |
5 | 23304334330441130012 |
6 | 302351554122135212 |
7 | 13646454660530645 |
oct | 1365041032377230 |
9 | 224175737434528 |
10 | 52025080020632 |
11 | 15638792420654 |
12 | 5a02986051508 |
13 | 2304c36c5a434 |
14 | cbc054d10dcc |
15 | 603459869972 |
hex | 2f510869fe98 |
52025080020632 has 16 divisors (see below), whose sum is σ = 97551585549600. Its totient is φ = 26011323874080.
The previous prime is 52025080020611. The next prime is 52025080020659. The reversal of 52025080020632 is 23602008052025.
52025080020632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 52025080020592 and 52025080020601.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 151835207 + ... + 152177462.
It is an arithmetic number, because the mean of its divisors is an integer number (6096974096850).
Almost surely, 252025080020632 is an apocalyptic number.
It is an amenable number.
52025080020632 is a deficient number, since it is larger than the sum of its proper divisors (45526505528968).
52025080020632 is a wasteful number, since it uses less digits than its factorization.
52025080020632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304034066 (or 304034062 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 52025080020632 its reverse (23602008052025), we get a palindrome (75627088072657).
The spelling of 52025080020632 in words is "fifty-two trillion, twenty-five billion, eighty million, twenty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •