Base | Representation |
---|---|
bin | 10111011100101101011101… |
… | …00100100111000010001100 |
3 | 20202120110201121012100120021 |
4 | 23232112232210213002030 |
5 | 23224311043333034012 |
6 | 301400102453431524 |
7 | 13601243160434464 |
oct | 1356265644470214 |
9 | 222513647170507 |
10 | 51564011221132 |
11 | 154801a1077323 |
12 | 594954b03b5a4 |
13 | 22a0608616797 |
14 | ca39d635cba4 |
15 | 5e647199c007 |
hex | 2ee5ae92708c |
51564011221132 has 48 divisors (see below), whose sum is σ = 95084355794400. Its totient is φ = 24399857456640.
The previous prime is 51564011221109. The next prime is 51564011221153. The reversal of 51564011221132 is 23112211046515.
51564011221132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×515640112211322 (a number of 28 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1075727838 + ... + 1075775770.
It is an arithmetic number, because the mean of its divisors is an integer number (1980924079050).
Almost surely, 251564011221132 is an apocalyptic number.
It is an amenable number.
51564011221132 is a deficient number, since it is larger than the sum of its proper divisors (43520344573268).
51564011221132 is a wasteful number, since it uses less digits than its factorization.
51564011221132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62266 (or 62264 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 34.
Adding to 51564011221132 its reverse (23112211046515), we get a palindrome (74676222267647).
The spelling of 51564011221132 in words is "fifty-one trillion, five hundred sixty-four billion, eleven million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •