Base | Representation |
---|---|
bin | 1001010010001101111000… |
… | …01011101101111101001001 |
3 | 2200021212012100211210020110 |
4 | 10221012330023231331021 |
5 | 10134003244001340223 |
6 | 111231300402144533 |
7 | 4205042452613256 |
oct | 451067413557511 |
9 | 80255170753213 |
10 | 20417136746313 |
11 | 656194a46859a |
12 | 2358b89952149 |
13 | b51435053848 |
14 | 5082a233842d |
15 | 25616ae68d93 |
hex | 1291bc2edf49 |
20417136746313 has 4 divisors (see below), whose sum is σ = 27222848995088. Its totient is φ = 13611424497540.
The previous prime is 20417136746243. The next prime is 20417136746327. The reversal of 20417136746313 is 31364763171402.
It is a happy number.
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 not a de Polignac number, because 20417136746313 - 28 = 20417136746057 is a prime.
It is a super-2 number, since 2×204171367463132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20417136744313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3402856124383 + ... + 3402856124388.
It is an arithmetic number, because the mean of its divisors is an integer number (6805712248772).
Almost surely, 220417136746313 is an apocalyptic number.
It is an amenable number.
20417136746313 is a deficient number, since it is larger than the sum of its proper divisors (6805712248775).
20417136746313 is an equidigital number, since it uses as much as digits as its factorization.
20417136746313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6805712248774.
The product of its (nonzero) digits is 1524096, while the sum is 48.
The spelling of 20417136746313 in words is "twenty trillion, four hundred seventeen billion, one hundred thirty-six million, seven hundred forty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •