Base | Representation |
---|---|
bin | 1001001010000000110001… |
… | …11111110010111110100101 |
3 | 2122021220112112011010211121 |
4 | 10211000120333302332211 |
5 | 10114343420332420314 |
6 | 110453554541533541 |
7 | 4145502446411554 |
oct | 445003077627645 |
9 | 78256475133747 |
10 | 20135226060709 |
11 | 6463335206a01 |
12 | 23124125742b1 |
13 | b30988ac7386 |
14 | 4d879b831d9b |
15 | 24db6b906d24 |
hex | 125018ff2fa5 |
20135226060709 has 4 divisors (see below), whose sum is σ = 20137042183104. Its totient is φ = 20133409938316.
The previous prime is 20135226060623. The next prime is 20135226060793. The reversal of 20135226060709 is 90706062253102.
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.
It is a cyclic number.
It is not a de Polignac number, because 20135226060709 - 219 = 20135225536421 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 (20135226063709) 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, 908044567 + ... + 908066740.
It is an arithmetic number, because the mean of its divisors is an integer number (5034260545776).
Almost surely, 220135226060709 is an apocalyptic number.
It is an amenable number.
20135226060709 is a deficient number, since it is larger than the sum of its proper divisors (1816122395).
20135226060709 is a wasteful number, since it uses less digits than its factorization.
20135226060709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1816122394.
The product of its (nonzero) digits is 272160, while the sum is 43.
The spelling of 20135226060709 in words is "twenty trillion, one hundred thirty-five billion, two hundred twenty-six million, sixty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •