Base | Representation |
---|---|
bin | 11011000101111001… |
… | …11111000110001101 |
3 | 1101112200002102001000 |
4 | 31202330333012031 |
5 | 214242013244031 |
6 | 10403143010513 |
7 | 1023303636330 |
oct | 154274770615 |
9 | 41480072030 |
10 | 14545056141 |
11 | 6194339a60 |
12 | 299b139a39 |
13 | 14aa50acc5 |
14 | 9bda3a617 |
15 | 5a1deb3e6 |
hex | 362f3f18d |
14545056141 has 128 divisors (see below), whose sum is σ = 27301478400. Its totient is φ = 7434478080.
The previous prime is 14545056121. The next prime is 14545056151. The reversal of 14545056141 is 14165054541.
14545056141 is a `hidden beast` number, since 1 + 4 + 5 + 4 + 50 + 561 + 41 = 666.
It is not a de Polignac number, because 14545056141 - 25 = 14545056109 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14545056096 and 14545056105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14545056101) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 63515415 + ... + 63515643.
It is an arithmetic number, because the mean of its divisors is an integer number (213292800).
Almost surely, 214545056141 is an apocalyptic number.
14545056141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14545056141 is a deficient number, since it is larger than the sum of its proper divisors (12756422259).
14545056141 is a wasteful number, since it uses less digits than its factorization.
14545056141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616 (or 610 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
The spelling of 14545056141 in words is "fourteen billion, five hundred forty-five million, fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •