Base | Representation |
---|---|
bin | 10111011110111110110… |
… | …100101000101001001001 |
3 | 12201021112111010210201112 |
4 | 113132332310220221021 |
5 | 202420042414030001 |
6 | 3233213115100105 |
7 | 224410551260135 |
oct | 27367664505111 |
9 | 5637474123645 |
10 | 1613814205001 |
11 | 572462057139 |
12 | 220927141635 |
13 | b9249bb243b |
14 | 5817523c3c5 |
15 | 2bea4266cbb |
hex | 177bed28a49 |
1613814205001 has 8 divisors (see below), whose sum is σ = 1748482696224. Its totient is φ = 1483561074240.
The previous prime is 1613814204997. The next prime is 1613814205007. The reversal of 1613814205001 is 1005024183161.
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 1613814205001 - 22 = 1613814204997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1613814205007) 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 7 ways as a sum of consecutive naturals, for example, 1103839355 + ... + 1103840816.
It is an arithmetic number, because the mean of its divisors is an integer number (218560337028).
Almost surely, 21613814205001 is an apocalyptic number.
It is an amenable number.
1613814205001 is a deficient number, since it is larger than the sum of its proper divisors (134668491223).
1613814205001 is a wasteful number, since it uses less digits than its factorization.
1613814205001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2207680231.
The product of its (nonzero) digits is 5760, while the sum is 32.
Adding to 1613814205001 its reverse (1005024183161), we get a palindrome (2618838388162).
The spelling of 1613814205001 in words is "one trillion, six hundred thirteen billion, eight hundred fourteen million, two hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •