Base | Representation |
---|---|
bin | 101111100011000101… |
… | …010010010100100101 |
3 | 11212210001221222122200 |
4 | 233203011102110211 |
5 | 1314024420012203 |
6 | 35242030045113 |
7 | 3455114461551 |
oct | 574305222445 |
9 | 155701858580 |
10 | 51054454053 |
11 | 1a7199a9a89 |
12 | 9a8a049799 |
13 | 4a78364735 |
14 | 26847b4861 |
15 | 14dc2309a3 |
hex | be3152525 |
51054454053 has 12 divisors (see below), whose sum is σ = 73813179648. Its totient is φ = 34004984040.
The previous prime is 51054454049. The next prime is 51054454069. The reversal of 51054454053 is 35045445015.
51054454053 is a `hidden beast` number, since 5 + 10 + 54 + 4 + 540 + 53 = 666.
It is not a de Polignac number, because 51054454053 - 22 = 51054454049 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51054453999 and 51054454017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51054454753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2599563 + ... + 2619128.
It is an arithmetic number, because the mean of its divisors is an integer number (6151098304).
Almost surely, 251054454053 is an apocalyptic number.
It is an amenable number.
51054454053 is a deficient number, since it is larger than the sum of its proper divisors (22758725595).
51054454053 is a wasteful number, since it uses less digits than its factorization.
51054454053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5219784 (or 5219781 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
Adding to 51054454053 its reverse (35045445015), we get a palindrome (86099899068).
The spelling of 51054454053 in words is "fifty-one billion, fifty-four million, four hundred fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •