Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001110110001010101 |
3 | 1220121220122100021122 |
4 | 102220022032301111 |
5 | 311430241422123 |
6 | 13104405253325 |
7 | 1305434513105 |
oct | 225012166125 |
9 | 56556570248 |
10 | 20001123413 |
11 | 8534127067 |
12 | 3a62404245 |
13 | 1b699ac08b |
14 | d7a4d9205 |
15 | 7c0dddbc8 |
hex | 4a828ec55 |
20001123413 has 4 divisors (see below), whose sum is σ = 20002291020. Its totient is φ = 19999955808.
The previous prime is 20001123391. The next prime is 20001123469. The reversal of 20001123413 is 31432110002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9335810884 + 10665312529 = 96622^2 + 103273^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001123413 - 26 = 20001123349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20001123391 and 20001123400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001123473) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 557720 + ... + 592497.
It is an arithmetic number, because the mean of its divisors is an integer number (5000572755).
Almost surely, 220001123413 is an apocalyptic number.
It is an amenable number.
20001123413 is a deficient number, since it is larger than the sum of its proper divisors (1167607).
20001123413 is a wasteful number, since it uses less digits than its factorization.
20001123413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1167606.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20001123413 its reverse (31432110002), we get a palindrome (51433233415).
The spelling of 20001123413 in words is "twenty billion, one million, one hundred twenty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.010 sec. • engine limits •