Base | Representation |
---|---|
bin | 101111100110100101… |
… | …111001011010100000 |
3 | 11212221011202102100110 |
4 | 233212211321122200 |
5 | 1314140003200212 |
6 | 35251532051320 |
7 | 3456431113506 |
oct | 574645713240 |
9 | 155834672313 |
10 | 51113334432 |
11 | 1a74a165756 |
12 | 9aa5903b40 |
13 | 4a8760bbb4 |
14 | 268c540676 |
15 | 14e24b1a3c |
hex | be69796a0 |
51113334432 has 48 divisors (see below), whose sum is σ = 134463665952. Its totient is φ = 17000805120.
The previous prime is 51113334373. The next prime is 51113334487. The reversal of 51113334432 is 23443331115.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×511133344322 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51113334432.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 533218 + ... + 621729.
It is an arithmetic number, because the mean of its divisors is an integer number (2801326374).
Almost surely, 251113334432 is an apocalyptic number.
It is an amenable number.
51113334432 is an abundant number, since it is smaller than the sum of its proper divisors (83350331520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51113334432 is a wasteful number, since it uses less digits than its factorization.
51113334432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1155421 (or 1155413 counting only the distinct ones).
The product of its digits is 12960, while the sum is 30.
Adding to 51113334432 its reverse (23443331115), we get a palindrome (74556665547).
The spelling of 51113334432 in words is "fifty-one billion, one hundred thirteen million, three hundred thirty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •