Base | Representation |
---|---|
bin | 10010101110111001… |
… | …111111001000000101 |
3 | 1220220210121120222022 |
4 | 102232321333020011 |
5 | 312143230234131 |
6 | 13123531212525 |
7 | 1311310530131 |
oct | 225671771005 |
9 | 56823546868 |
10 | 20114305541 |
11 | 8592001510 |
12 | 3a942a7145 |
13 | 1b87289955 |
14 | d8b55c3c1 |
15 | 7cace937b |
hex | 4aee7f205 |
20114305541 has 8 divisors (see below), whose sum is σ = 22012987584. Its totient is φ = 18227308320.
The previous prime is 20114305469. The next prime is 20114305553. The reversal of 20114305541 is 14550341102.
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 20114305541 - 226 = 20047196677 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 20114305541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20114305571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2917601 + ... + 2924486.
It is an arithmetic number, because the mean of its divisors is an integer number (2751623448).
Almost surely, 220114305541 is an apocalyptic number.
It is an amenable number.
20114305541 is a deficient number, since it is larger than the sum of its proper divisors (1898682043).
20114305541 is a wasteful number, since it uses less digits than its factorization.
20114305541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5842411.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 20114305541 its reverse (14550341102), we get a palindrome (34664646643).
The spelling of 20114305541 in words is "twenty billion, one hundred fourteen million, three hundred five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •