Base | Representation |
---|---|
bin | 101111100110010101… |
… | …010111010100010111 |
3 | 11212220212121020021101 |
4 | 233212111113110113 |
5 | 1314132401003341 |
6 | 35251255130531 |
7 | 3456346223164 |
oct | 574625272427 |
9 | 155825536241 |
10 | 51109000471 |
11 | 1a747775571 |
12 | 9aa4373a47 |
13 | 4a86752319 |
14 | 268bb3306b |
15 | 14e1e07831 |
hex | be6557517 |
51109000471 has 8 divisors (see below), whose sum is σ = 51265616688. Its totient is φ = 50952552000.
The previous prime is 51109000463. The next prime is 51109000493. The reversal of 51109000471 is 17400090115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51109000471 - 23 = 51109000463 is a prime.
It is a super-3 number, since 3×511090004713 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a pancake number, because a pancake can be divided into 51109000471 parts by 319715 straight cuts.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51109000871) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582516 + ... + 664486.
It is an arithmetic number, because the mean of its divisors is an integer number (6408202086).
Almost surely, 251109000471 is an apocalyptic number.
51109000471 is a deficient number, since it is larger than the sum of its proper divisors (156616217).
51109000471 is a wasteful number, since it uses less digits than its factorization.
51109000471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83873.
The product of its (nonzero) digits is 1260, while the sum is 28.
Adding to 51109000471 its reverse (17400090115), we get a palindrome (68509090586).
The spelling of 51109000471 in words is "fifty-one billion, one hundred nine million, four hundred seventy-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •