Base | Representation |
---|---|
bin | 1001010011011101111011… |
… | …11010001011100000000011 |
3 | 2200102222010121201101200211 |
4 | 10221232331322023200003 |
5 | 10140204304014014011 |
6 | 111303125223254551 |
7 | 4211123506133104 |
oct | 451567572134003 |
9 | 80388117641624 |
10 | 20460115376131 |
11 | 65790a4810272 |
12 | 23653832aa457 |
13 | b554c4247652 |
14 | 50a3bc3483ab |
15 | 2573341c2b21 |
hex | 129bbde8b803 |
20460115376131 has 4 divisors (see below), whose sum is σ = 20460160979064. Its totient is φ = 20460069773200.
The previous prime is 20460115376117. The next prime is 20460115376147. The reversal of 20460115376131 is 13167351106402.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20460115376131 - 233 = 20451525441539 is a prime.
It is a super-2 number, since 2×204601153761312 (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 (20460115376111) 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, 22121725 + ... + 23028046.
It is an arithmetic number, because the mean of its divisors is an integer number (5115040244766).
Almost surely, 220460115376131 is an apocalyptic number.
20460115376131 is a deficient number, since it is larger than the sum of its proper divisors (45602933).
20460115376131 is an equidigital number, since it uses as much as digits as its factorization.
20460115376131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45602932.
The product of its (nonzero) digits is 90720, while the sum is 40.
The spelling of 20460115376131 in words is "twenty trillion, four hundred sixty billion, one hundred fifteen million, three hundred seventy-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •