Base | Representation |
---|---|
bin | 110010111010101010… |
… | …001101100110011001 |
3 | 12020010010120112001101 |
4 | 302322222031212121 |
5 | 1343431314013411 |
6 | 41040550151401 |
7 | 3643542556042 |
oct | 627252154631 |
9 | 166103515041 |
10 | 54671235481 |
11 | 2120553a445 |
12 | a719352561 |
13 | 520376bca5 |
14 | 2908c918c9 |
15 | 164ea098c1 |
hex | cbaa8d999 |
54671235481 has 8 divisors (see below), whose sum is σ = 55091574504. Its totient is φ = 54251205120.
The previous prime is 54671235467. The next prime is 54671235491. The reversal of 54671235481 is 18453217645.
It can be written as a sum of positive squares in 4 ways, for example, as 9828937881 + 44842297600 = 99141^2 + 211760^2 .
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 54671235481 - 25 = 54671235449 is a prime.
It is a super-2 number, since 2×546712354812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54671235401) 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 7 ways as a sum of consecutive naturals, for example, 284941 + ... + 436501.
It is an arithmetic number, because the mean of its divisors is an integer number (6886446813).
Almost surely, 254671235481 is an apocalyptic number.
It is an amenable number.
54671235481 is a deficient number, since it is larger than the sum of its proper divisors (420339023).
54671235481 is a wasteful number, since it uses less digits than its factorization.
54671235481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154331.
The product of its digits is 806400, while the sum is 46.
The spelling of 54671235481 in words is "fifty-four billion, six hundred seventy-one million, two hundred thirty-five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •