Base | Representation |
---|---|
bin | 101000110111101101111… |
… | …1001011001010011000001 |
3 | 201220000000010110120201212 |
4 | 1101233123321121103001 |
5 | 1214013022121341001 |
6 | 15540302241135505 |
7 | 1116554511023345 |
oct | 121573371312301 |
9 | 21800003416655 |
10 | 5617211512001 |
11 | 1876278504841 |
12 | 7687a092a595 |
13 | 31991579ccab |
14 | 155c35847625 |
15 | 9b1b35e67bb |
hex | 51bdbe594c1 |
5617211512001 has 4 divisors (see below), whose sum is σ = 5641956937392. Its totient is φ = 5592466086612.
The previous prime is 5617211511973. The next prime is 5617211512009. The reversal of 5617211512001 is 1002151127165.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5617211512001 - 214 = 5617211495617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5617211512009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12372712355 + ... + 12372712808.
It is an arithmetic number, because the mean of its divisors is an integer number (1410489234348).
Almost surely, 25617211512001 is an apocalyptic number.
It is an amenable number.
5617211512001 is a deficient number, since it is larger than the sum of its proper divisors (24745425391).
5617211512001 is a wasteful number, since it uses less digits than its factorization.
5617211512001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24745425390.
The product of its (nonzero) digits is 4200, while the sum is 32.
Adding to 5617211512001 its reverse (1002151127165), we get a palindrome (6619362639166).
The spelling of 5617211512001 in words is "five trillion, six hundred seventeen billion, two hundred eleven million, five hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •