Base | Representation |
---|---|
bin | 110010010101010110… |
… | …111000010101001011 |
3 | 12011111111222022202101 |
4 | 302111112320111023 |
5 | 1341141111120020 |
6 | 40454512414231 |
7 | 3622203260566 |
oct | 622526702513 |
9 | 164444868671 |
10 | 54045410635 |
11 | 20a14252a27 |
12 | a583847377 |
13 | 5133c00928 |
14 | 2889b054dd |
15 | 1614ada00a |
hex | c955b854b |
54045410635 has 4 divisors (see below), whose sum is σ = 64854492768. Its totient is φ = 43236328504.
The previous prime is 54045410593. The next prime is 54045410647. The reversal of 54045410635 is 53601454045.
54045410635 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53601454045 = 5 ⋅10720290809.
It is a cyclic number.
It is not a de Polignac number, because 54045410635 - 29 = 54045410123 is a prime.
It is a super-2 number, since 2×540454106352 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54045410594 and 54045410603.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5404541059 + ... + 5404541068.
It is an arithmetic number, because the mean of its divisors is an integer number (16213623192).
Almost surely, 254045410635 is an apocalyptic number.
54045410635 is a deficient number, since it is larger than the sum of its proper divisors (10809082133).
54045410635 is a wasteful number, since it uses less digits than its factorization.
54045410635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10809082132.
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 54045410635 in words is "fifty-four billion, forty-five million, four hundred ten thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •