Base | Representation |
---|---|
bin | 101111100110101001… |
… | …010001110111111110 |
3 | 11212221020102110120022 |
4 | 233212221101313332 |
5 | 1314140220033204 |
6 | 35252003052142 |
7 | 3456441465431 |
oct | 574651216776 |
9 | 155836373508 |
10 | 51114221054 |
11 | 1a74a7108a6 |
12 | 9aa6071052 |
13 | 4a8785c620 |
14 | 268c6d1818 |
15 | 14e25d95be |
hex | be6a51dfe |
51114221054 has 8 divisors (see below), whose sum is σ = 82569126360. Its totient is φ = 23591178936.
The previous prime is 51114221027. The next prime is 51114221077. The reversal of 51114221054 is 45012241115.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×511142210542 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 1965931579 = 51114221054 / (5 + 1 + 1 + 1 + 4 + 2 + 2 + 1 + 0 + 5 + 4).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 982965764 + ... + 982965815.
It is an arithmetic number, because the mean of its divisors is an integer number (10321140795).
Almost surely, 251114221054 is an apocalyptic number.
51114221054 is a deficient number, since it is larger than the sum of its proper divisors (31454905306).
51114221054 is a wasteful number, since it uses less digits than its factorization.
51114221054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1965931594.
The product of its (nonzero) digits is 1600, while the sum is 26.
Adding to 51114221054 its reverse (45012241115), we get a palindrome (96126462169).
The spelling of 51114221054 in words is "fifty-one billion, one hundred fourteen million, two hundred twenty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •