Base | Representation |
---|---|
bin | 110010010100000001… |
… | …100001000100110101 |
3 | 12011102221212102121022 |
4 | 302110001201010311 |
5 | 1341114344030031 |
6 | 40452353030525 |
7 | 3621512130230 |
oct | 622401410465 |
9 | 164387772538 |
10 | 54023033141 |
11 | 20a02659430 |
12 | a578255445 |
13 | 512c3972cc |
14 | 2886b5c417 |
15 | 1612b6997b |
hex | c94061135 |
54023033141 has 8 divisors (see below), whose sum is σ = 67353392064. Its totient is φ = 42095869920.
The previous prime is 54023033117. The next prime is 54023033153. The reversal of 54023033141 is 14133032045.
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 54023033141 - 210 = 54023032117 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 54023033141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54023033191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350798840 + ... + 350798993.
It is an arithmetic number, because the mean of its divisors is an integer number (8419174008).
Almost surely, 254023033141 is an apocalyptic number.
It is an amenable number.
54023033141 is a deficient number, since it is larger than the sum of its proper divisors (13330358923).
54023033141 is a wasteful number, since it uses less digits than its factorization.
54023033141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701597851.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 54023033141 its reverse (14133032045), we get a palindrome (68156065186).
The spelling of 54023033141 in words is "fifty-four billion, twenty-three million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •