Base | Representation |
---|---|
bin | 1001000110000110100110… |
… | …01000101101100010111101 |
3 | 2121211001211210210121211202 |
4 | 10203003103020231202331 |
5 | 10110143330430201321 |
6 | 110312142522425245 |
7 | 4133006123654636 |
oct | 443032310554275 |
9 | 77731753717752 |
10 | 20000910006461 |
11 | 641137a30439a |
12 | 22b0388362225 |
13 | b211019a1bb7 |
14 | 4d209906088d |
15 | 24a409bdc70b |
hex | 1230d322d8bd |
20000910006461 has 8 divisors (see below), whose sum is σ = 20183361647544. Its totient is φ = 19818554022400.
The previous prime is 20000910006457. The next prime is 20000910006481. The reversal of 20000910006461 is 16460001900002.
It can be written as a sum of positive squares in 4 ways, for example, as 1158408774436 + 18842501232025 = 1076294^2 + 4340795^2 .
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 20000910006461 - 22 = 20000910006457 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000910006431) 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, 23494136 + ... + 24330561.
It is an arithmetic number, because the mean of its divisors is an integer number (2522920205943).
Almost surely, 220000910006461 is an apocalyptic number.
It is an amenable number.
20000910006461 is a deficient number, since it is larger than the sum of its proper divisors (182451641083).
20000910006461 is a wasteful number, since it uses less digits than its factorization.
20000910006461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47828511.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 20000910006461 its reverse (16460001900002), we get a palindrome (36460911906463).
The spelling of 20000910006461 in words is "twenty trillion, nine hundred ten million, six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •