Base | Representation |
---|---|
bin | 11001000011111111010011… |
… | …11111101001011110010011 |
3 | 21020010201101102021210202012 |
4 | 30201333221333221132103 |
5 | 24210431202143320001 |
6 | 313114222531013135 |
7 | 14415520605235541 |
oct | 1441775177513623 |
9 | 236121342253665 |
10 | 55112651151251 |
11 | 16619164877951 |
12 | 622124b43a1ab |
13 | 249a140326495 |
14 | d876762ccd91 |
15 | 6589170b02bb |
hex | 321fe9fe9793 |
55112651151251 has 8 divisors (see below), whose sum is σ = 56423545531584. Its totient is φ = 53803084262760.
The previous prime is 55112651151223. The next prime is 55112651151277. The reversal of 55112651151251 is 15215115621155.
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 55112651151251 - 214 = 55112651134867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55112651151199 and 55112651151208.
It is not an unprimeable number, because it can be changed into a prime (55112651150251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 331788941 + ... + 331955006.
It is an arithmetic number, because the mean of its divisors is an integer number (7052943191448).
Almost surely, 255112651151251 is an apocalyptic number.
55112651151251 is a deficient number, since it is larger than the sum of its proper divisors (1310894380333).
55112651151251 is a wasteful number, since it uses less digits than its factorization.
55112651151251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663745921.
The product of its digits is 75000, while the sum is 41.
The spelling of 55112651151251 in words is "fifty-five trillion, one hundred twelve billion, six hundred fifty-one million, one hundred fifty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •