Base | Representation |
---|---|
bin | 10010101010011111… |
… | …001100101011101001 |
3 | 1220201122010100001021 |
4 | 102222133030223221 |
5 | 312020241034223 |
6 | 13112322252441 |
7 | 1306420446115 |
oct | 225237145351 |
9 | 56648110037 |
10 | 20040174313 |
11 | 8554179635 |
12 | 3a734b7121 |
13 | 1b74b02913 |
14 | d81782745 |
15 | 7c455465d |
hex | 4aa7ccae9 |
20040174313 has 4 divisors (see below), whose sum is σ = 20040476560. Its totient is φ = 20039872068.
The previous prime is 20040174307. The next prime is 20040174373. The reversal of 20040174313 is 31347104002.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31347104002 = 2 ⋅15673552001.
It is a cyclic number.
It is not a de Polignac number, because 20040174313 - 213 = 20040166121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20040174373) 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 3 ways as a sum of consecutive naturals, for example, 3783 + ... + 200236.
It is an arithmetic number, because the mean of its divisors is an integer number (5010119140).
Almost surely, 220040174313 is an apocalyptic number.
It is an amenable number.
20040174313 is a deficient number, since it is larger than the sum of its proper divisors (302247).
20040174313 is an equidigital number, since it uses as much as digits as its factorization.
20040174313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302246.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 20040174313 its reverse (31347104002), we get a palindrome (51387278315).
The spelling of 20040174313 in words is "twenty billion, forty million, one hundred seventy-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •