Base | Representation |
---|---|
bin | 1001001101101001111101… |
… | …00011001000011111110011 |
3 | 2122201212122211001212212202 |
4 | 10212310332203020133303 |
5 | 10123421304443214332 |
6 | 111031300503013415 |
7 | 4160523564436031 |
oct | 446647643103763 |
9 | 78655584055782 |
10 | 20260410132467 |
11 | 650143437194a |
12 | 233272a43a26b |
13 | b3c71900b60b |
14 | 500875473551 |
15 | 252046a73a62 |
hex | 126d3e8c87f3 |
20260410132467 has 8 divisors (see below), whose sum is σ = 21327179697600. Its totient is φ = 19193683786344.
The previous prime is 20260410132409. The next prime is 20260410132481. The reversal of 20260410132467 is 76423101406202.
It is a happy number.
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 20260410132467 - 226 = 20260343023603 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20260410132467.
It is not an unprimeable number, because it can be changed into a prime (20260418132467) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9840293 + ... + 11719734.
It is an arithmetic number, because the mean of its divisors is an integer number (2665897462200).
Almost surely, 220260410132467 is an apocalyptic number.
20260410132467 is a deficient number, since it is larger than the sum of its proper divisors (1066769565133).
20260410132467 is a wasteful number, since it uses less digits than its factorization.
20260410132467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21609505.
The product of its (nonzero) digits is 96768, while the sum is 38.
Adding to 20260410132467 its reverse (76423101406202), we get a palindrome (96683511538669).
The spelling of 20260410132467 in words is "twenty trillion, two hundred sixty billion, four hundred ten million, one hundred thirty-two thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •