Base | Representation |
---|---|
bin | 11011000101100111… |
… | …01100010101110101 |
3 | 1101112111111122022100 |
4 | 31202303230111311 |
5 | 214240402320041 |
6 | 10403014452313 |
7 | 1023244142046 |
oct | 154263542565 |
9 | 41474448270 |
10 | 14542620021 |
11 | 6192a25736 |
12 | 299a364099 |
13 | 14a9b67207 |
14 | 9bd5a48cd |
15 | 5a1ab96b6 |
hex | 362cec575 |
14542620021 has 48 divisors (see below), whose sum is σ = 22477792896. Its totient is φ = 9039558528.
The previous prime is 14542619957. The next prime is 14542620023. The reversal of 14542620021 is 12002624541.
14542620021 is a `hidden beast` number, since 1 + 454 + 2 + 6 + 200 + 2 + 1 = 666.
It is not a de Polignac number, because 14542620021 - 26 = 14542619957 is a prime.
It is a super-2 number, since 2×145426200212 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14542620023) 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 47 ways as a sum of consecutive naturals, for example, 1718226 + ... + 1726668.
It is an arithmetic number, because the mean of its divisors is an integer number (468287352).
Almost surely, 214542620021 is an apocalyptic number.
It is an amenable number.
14542620021 is a deficient number, since it is larger than the sum of its proper divisors (7935172875).
14542620021 is a wasteful number, since it uses less digits than its factorization.
14542620021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8682 (or 8679 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The spelling of 14542620021 in words is "fourteen billion, five hundred forty-two million, six hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •