Base | Representation |
---|---|
bin | 110010011010011101… |
… | …011110000010010110 |
3 | 12011201111001221020120 |
4 | 302122131132002112 |
5 | 1341330020232042 |
6 | 40511211412410 |
7 | 3624263053365 |
oct | 623235360226 |
9 | 164644057216 |
10 | 54131024022 |
11 | 20a58608599 |
12 | a5a8454106 |
13 | 514887803a |
14 | 289722d7dc |
15 | 161c39bdec |
hex | c9a75e096 |
54131024022 has 8 divisors (see below), whose sum is σ = 108262048056. Its totient is φ = 18043674672.
The previous prime is 54131023993. The next prime is 54131024023. The reversal of 54131024022 is 22042013145.
54131024022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
54131024022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 54131023983 and 54131024001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54131024023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4510918663 + ... + 4510918674.
It is an arithmetic number, because the mean of its divisors is an integer number (13532756007).
Almost surely, 254131024022 is an apocalyptic number.
54131024022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54131024022 is a wasteful number, since it uses less digits than its factorization.
54131024022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9021837342.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 54131024022 its reverse (22042013145), we get a palindrome (76173037167).
The spelling of 54131024022 in words is "fifty-four billion, one hundred thirty-one million, twenty-four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •