Base | Representation |
---|---|
bin | 101111100110011101… |
… | …001010100100011001 |
3 | 11212221000110010101112 |
4 | 233212131022210121 |
5 | 1314133411423101 |
6 | 35251411030105 |
7 | 3456402501113 |
oct | 574635124431 |
9 | 155830403345 |
10 | 51111045401 |
11 | 1a748941999 |
12 | 9aa4b9b335 |
13 | 4a86cba040 |
14 | 268c1063b3 |
15 | 14e21ad6bb |
hex | be674a919 |
51111045401 has 16 divisors (see below), whose sum is σ = 55678225680. Its totient is φ = 46634987520.
The previous prime is 51111045379. The next prime is 51111045467. The reversal of 51111045401 is 10454011115.
It can be written as a sum of positive squares in 8 ways, for example, as 15221637376 + 35889408025 = 123376^2 + 189445^2 .
It is a cyclic number.
It is not a de Polignac number, because 51111045401 - 214 = 51111029017 is a prime.
It is a super-2 number, since 2×511110454012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51111005401) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6258761 + ... + 6266921.
It is an arithmetic number, because the mean of its divisors is an integer number (3479889105).
Almost surely, 251111045401 is an apocalyptic number.
It is an amenable number.
51111045401 is a deficient number, since it is larger than the sum of its proper divisors (4567180279).
51111045401 is a wasteful number, since it uses less digits than its factorization.
51111045401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13676.
The product of its (nonzero) digits is 400, while the sum is 23.
Adding to 51111045401 its reverse (10454011115), we get a palindrome (61565056516).
The spelling of 51111045401 in words is "fifty-one billion, one hundred eleven million, forty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •