Base | Representation |
---|---|
bin | 100000001110011100101… |
… | …010110000101011000111 |
3 | 21211201002212022222001221 |
4 | 200032130222300223013 |
5 | 242240332333100201 |
6 | 4413202153101211 |
7 | 315665165423464 |
oct | 40163452605307 |
9 | 7751085288057 |
10 | 2214536612551 |
11 | 7841a820416a |
12 | 2b92379b7807 |
13 | 130aa33c6223 |
14 | 7928141066b |
15 | 3c9127314a1 |
hex | 2039cab0ac7 |
2214536612551 has 8 divisors (see below), whose sum is σ = 2341728724608. Its totient is φ = 2090829216000.
The previous prime is 2214536612539. The next prime is 2214536612557. The reversal of 2214536612551 is 1552166354122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2214536612551 - 219 = 2214536088263 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2214536612498 and 2214536612507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2214536612557) 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 7 ways as a sum of consecutive naturals, for example, 871177570 + ... + 871180111.
It is an arithmetic number, because the mean of its divisors is an integer number (292716090576).
Almost surely, 22214536612551 is an apocalyptic number.
2214536612551 is a deficient number, since it is larger than the sum of its proper divisors (127192112057).
2214536612551 is a wasteful number, since it uses less digits than its factorization.
2214536612551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1742357753.
The product of its digits is 432000, while the sum is 43.
The spelling of 2214536612551 in words is "two trillion, two hundred fourteen billion, five hundred thirty-six million, six hundred twelve thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •