Base | Representation |
---|---|
bin | 11101111001000100111… |
… | …100110100000011111000 |
3 | 21021101010022210210122200 |
4 | 131321010330310003320 |
5 | 232123400144110211 |
6 | 4211355232150200 |
7 | 301256531525202 |
oct | 35710474640370 |
9 | 7241108723580 |
10 | 2054151160056 |
11 | 722184861926 |
12 | 292137098360 |
13 | 11b92333c708 |
14 | 715c8641772 |
15 | 38677005b56 |
hex | 1de44f340f8 |
2054151160056 has 48 divisors (see below), whose sum is σ = 5603934304800. Its totient is φ = 679719115392.
The previous prime is 2054151160027. The next prime is 2054151160079. The reversal of 2054151160056 is 6500611514502.
2054151160056 is a `hidden beast` number, since 2 + 0 + 5 + 41 + 5 + 1 + 1 + 600 + 5 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2054151160056.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 104113776 + ... + 104133503.
It is an arithmetic number, because the mean of its divisors is an integer number (116748631350).
Almost surely, 22054151160056 is an apocalyptic number.
It is an amenable number.
2054151160056 is an abundant number, since it is smaller than the sum of its proper divisors (3549783144744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2054151160056 is a wasteful number, since it uses less digits than its factorization.
2054151160056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208247428 (or 208247421 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
Adding to 2054151160056 its reverse (6500611514502), we get a palindrome (8554762674558).
The spelling of 2054151160056 in words is "two trillion, fifty-four billion, one hundred fifty-one million, one hundred sixty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •