Base | Representation |
---|---|
bin | 10010101000001101… |
… | …100111100110010101 |
3 | 1220121222022110120021 |
4 | 102220031213212111 |
5 | 311431003332131 |
6 | 13104440305141 |
7 | 1305445202311 |
oct | 225015474625 |
9 | 56558273507 |
10 | 20002011541 |
11 | 8534683356 |
12 | 3a627721b1 |
13 | 1b69c303b5 |
14 | d7a68ab41 |
15 | 7c1016e11 |
hex | 4a8367995 |
20002011541 has 4 divisors (see below), whose sum is σ = 20154698784. Its totient is φ = 19849324300.
The previous prime is 20002011527. The next prime is 20002011599. The reversal of 20002011541 is 14511020002.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14511020002 = 2 ⋅7255510001.
It is a cyclic number.
It is not a de Polignac number, because 20002011541 - 27 = 20002011413 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 (20002011241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76343425 + ... + 76343686.
It is an arithmetic number, because the mean of its divisors is an integer number (5038674696).
Almost surely, 220002011541 is an apocalyptic number.
It is an amenable number.
20002011541 is a deficient number, since it is larger than the sum of its proper divisors (152687243).
20002011541 is a wasteful number, since it uses less digits than its factorization.
20002011541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152687242.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 20002011541 its reverse (14511020002), we get a palindrome (34513031543).
The spelling of 20002011541 in words is "twenty billion, two million, eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •