Base | Representation |
---|---|
bin | 110000110011000011010001… |
… | …011111011101111111110101 |
3 | 1001010212221101100211012102221 |
4 | 300303003101133131333311 |
5 | 211112220333234042010 |
6 | 2040240302441402341 |
7 | 63130244622234421 |
oct | 6063032137357765 |
9 | 1033787340735387 |
10 | 214614440534005 |
11 | 62423522770456 |
12 | 200a1871a993b1 |
13 | 929a0938133b5 |
14 | 3add574125b81 |
15 | 19c293295bdda |
hex | c330d17ddff5 |
214614440534005 has 24 divisors (see below), whose sum is σ = 257937998067360. Its totient is φ = 171424849296960.
The previous prime is 214614440534003. The next prime is 214614440534023. The reversal of 214614440534005 is 500435044416412.
It is not a de Polignac number, because 214614440534005 - 21 = 214614440534003 is a prime.
It is a super-2 number, since 2×2146144405340052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214614440534003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22036594426 + ... + 22036604164.
It is an arithmetic number, because the mean of its divisors is an integer number (10747416586140).
Almost surely, 2214614440534005 is an apocalyptic number.
It is an amenable number.
214614440534005 is a deficient number, since it is larger than the sum of its proper divisors (43323557533355).
214614440534005 is an frugal number, since it uses more digits than its factorization.
214614440534005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18949 (or 18192 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 43.
The spelling of 214614440534005 in words is "two hundred fourteen trillion, six hundred fourteen billion, four hundred forty million, five hundred thirty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •