Base | Representation |
---|---|
bin | 101111100110000110… |
… | …111101010111010111 |
3 | 11212220121111101010200 |
4 | 233212012331113113 |
5 | 1314130414133101 |
6 | 35251042151543 |
7 | 3456302144412 |
oct | 574606752727 |
9 | 155817441120 |
10 | 51105224151 |
11 | 1a745626343 |
12 | 9aa30525b3 |
13 | 4a85a2c507 |
14 | 268b42cb79 |
15 | 14e190d986 |
hex | be61bd5d7 |
51105224151 has 6 divisors (see below), whose sum is σ = 73818657120. Its totient is φ = 34070149428.
The previous prime is 51105224147. The next prime is 51105224197. The reversal of 51105224151 is 15142250115.
It is a happy number.
51105224151 is a `hidden beast` number, since 51 + 1 + 0 + 522 + 41 + 51 = 666.
It is not a de Polignac number, because 51105224151 - 22 = 51105224147 is a prime.
It is a super-2 number, since 2×511052241512 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51105224111) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 2839179111 + ... + 2839179128.
It is an arithmetic number, because the mean of its divisors is an integer number (12303109520).
Almost surely, 251105224151 is an apocalyptic number.
51105224151 is a deficient number, since it is larger than the sum of its proper divisors (22713432969).
51105224151 is a wasteful number, since it uses less digits than its factorization.
51105224151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5678358245 (or 5678358242 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 51105224151 its reverse (15142250115), we get a palindrome (66247474266).
The spelling of 51105224151 in words is "fifty-one billion, one hundred five million, two hundred twenty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •