Base | Representation |
---|---|
bin | 10111010010101111101010… |
… | …10001101100010000001110 |
3 | 20201100201220101012010122110 |
4 | 23221113311101230100032 |
5 | 23203203314103413210 |
6 | 300534513410124450 |
7 | 13534431666542232 |
oct | 1351276521542016 |
9 | 221321811163573 |
10 | 51221600060430 |
11 | 15358a5a987298 |
12 | 58b310a280726 |
13 | 227723a03ca17 |
14 | c911d27265c2 |
15 | 5dc5d0cc8420 |
hex | 2e95f546c40e |
51221600060430 has 64 divisors (see below), whose sum is σ = 124062389536320. Its totient is φ = 13533559904256.
The previous prime is 51221600060399. The next prime is 51221600060471. The reversal of 51221600060430 is 3406000612215.
51221600060430 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 (30).
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 31 ways as a sum of consecutive naturals, for example, 7264464 + ... + 12458556.
It is an arithmetic number, because the mean of its divisors is an integer number (1938474836505).
Almost surely, 251221600060430 is an apocalyptic number.
51221600060430 is an abundant number, since it is smaller than the sum of its proper divisors (72840789475890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51221600060430 is a wasteful number, since it uses less digits than its factorization.
51221600060430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5197125.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 51221600060430 its reverse (3406000612215), we get a palindrome (54627600672645).
The spelling of 51221600060430 in words is "fifty-one trillion, two hundred twenty-one billion, six hundred million, sixty thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •