Base | Representation |
---|---|
bin | 1001010011011110100101… |
… | …00001110101100010011011 |
3 | 2200110000000201122222022212 |
4 | 10221233102201311202123 |
5 | 10140211011044110001 |
6 | 111303223422105335 |
7 | 4211135206440635 |
oct | 451572241654233 |
9 | 80400021588285 |
10 | 20460461316251 |
11 | 65792620121a0 |
12 | 236545b11b24b |
13 | b5554ab0b948 |
14 | 50a412279a55 |
15 | 2573547587bb |
hex | 129bd287589b |
20460461316251 has 8 divisors (see below), whose sum is σ = 22320718767984. Its totient is φ = 18600239783520.
The previous prime is 20460461316203. The next prime is 20460461316263. The reversal of 20460461316251 is 15261316406402.
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 20460461316251 - 210 = 20460461315227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20460461316199 and 20460461316208.
It is not an unprimeable number, because it can be changed into a prime (20460461316151) 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, 7781756 + ... + 10073561.
It is an arithmetic number, because the mean of its divisors is an integer number (2790089845998).
Almost surely, 220460461316251 is an apocalyptic number.
20460461316251 is a deficient number, since it is larger than the sum of its proper divisors (1860257451733).
20460461316251 is a wasteful number, since it uses less digits than its factorization.
20460461316251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17959501.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 20460461316251 in words is "twenty trillion, four hundred sixty billion, four hundred sixty-one million, three hundred sixteen thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •