Base | Representation |
---|---|
bin | 11000110001100111110100… |
… | …11100101100001110100100 |
3 | 21010220101110002010122110020 |
4 | 30120303322130230032210 |
5 | 24120111222123221102 |
6 | 311512253015355140 |
7 | 14322110006436261 |
oct | 1430637234541644 |
9 | 233811402118406 |
10 | 54481567007652 |
11 | 163a5559276184 |
12 | 613aa86682ab0 |
13 | 24527888155c5 |
14 | d64cc9a2c268 |
15 | 6472cd365bbc |
hex | 318cfa72c3a4 |
54481567007652 has 96 divisors (see below), whose sum is σ = 131293826681472. Its totient is φ = 17575586835456.
The previous prime is 54481567007639. The next prime is 54481567007729. The reversal of 54481567007652 is 25670076518445.
54481567007652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×544815670076522 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14138118 + ... + 17574114.
It is an arithmetic number, because the mean of its divisors is an integer number (1367644027932).
Almost surely, 254481567007652 is an apocalyptic number.
It is an amenable number.
54481567007652 is an abundant number, since it is smaller than the sum of its proper divisors (76812259673820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54481567007652 is a wasteful number, since it uses less digits than its factorization.
54481567007652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3436397 (or 3436395 counting only the distinct ones).
The product of its (nonzero) digits is 56448000, while the sum is 60.
The spelling of 54481567007652 in words is "fifty-four trillion, four hundred eighty-one billion, five hundred sixty-seven million, seven thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •