Base | Representation |
---|---|
bin | 10111111000000010011110… |
… | …10100101010101110010010 |
3 | 20212220020110010000201112120 |
4 | 23330001033110222232102 |
5 | 23340202131311403432 |
6 | 303355314510435110 |
7 | 14026134362310303 |
oct | 1374011724525622 |
9 | 225806403021476 |
10 | 52503011044242 |
11 | 15802446a90490 |
12 | 5a7b528202a96 |
13 | 233b021b855a5 |
14 | cd723315a7aa |
15 | 610accc96c2c |
hex | 2fc04f52ab92 |
52503011044242 has 64 divisors (see below), whose sum is σ = 118997919590400. Its totient is φ = 15297108841280.
The previous prime is 52503011044181. The next prime is 52503011044277. The reversal of 52503011044242 is 24244011030525.
52503011044242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 56929668 + ... + 57844559.
It is an arithmetic number, because the mean of its divisors is an integer number (1859342493600).
Almost surely, 252503011044242 is an apocalyptic number.
52503011044242 is an abundant number, since it is smaller than the sum of its proper divisors (66494908546158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52503011044242 is a wasteful number, since it uses less digits than its factorization.
52503011044242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114774511.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 52503011044242 its reverse (24244011030525), we get a palindrome (76747022074767).
The spelling of 52503011044242 in words is "fifty-two trillion, five hundred three billion, eleven million, forty-four thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •