Base | Representation |
---|---|
bin | 110010111001110000… |
… | …111010100001011011 |
3 | 12020002002022102000010 |
4 | 302321300322201123 |
5 | 1343413442341011 |
6 | 41035252213003 |
7 | 3643301106660 |
oct | 627160724133 |
9 | 166062272003 |
10 | 54656215131 |
11 | 211a8010431 |
12 | a71430a163 |
13 | 52006102cb |
14 | 2906ca1a67 |
15 | 164d53e1a6 |
hex | cb9c3a85b |
54656215131 has 32 divisors (see below), whose sum is σ = 83543961600. Its totient is φ = 31135387680.
The previous prime is 54656215129. The next prime is 54656215139. The reversal of 54656215131 is 13151265645.
It is not a de Polignac number, because 54656215131 - 21 = 54656215129 is a prime.
It is a super-2 number, since 2×546562151312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54656215131.
It is not an unprimeable number, because it can be changed into a prime (54656215139) 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 31 ways as a sum of consecutive naturals, for example, 22225780 + ... + 22228238.
It is an arithmetic number, because the mean of its divisors is an integer number (2610748800).
Almost surely, 254656215131 is an apocalyptic number.
54656215131 is a deficient number, since it is larger than the sum of its proper divisors (28887746469).
54656215131 is a wasteful number, since it uses less digits than its factorization.
54656215131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5319.
The product of its digits is 108000, while the sum is 39.
The spelling of 54656215131 in words is "fifty-four billion, six hundred fifty-six million, two hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •