Base | Representation |
---|---|
bin | 10010110110100110… |
… | …000110011111001101 |
3 | 1221020210100201120021 |
4 | 102312212012133031 |
5 | 312424241414131 |
6 | 13144420222141 |
7 | 1314435205036 |
oct | 226646063715 |
9 | 57223321507 |
10 | 20243310541 |
11 | 8648903913 |
12 | 3b0b53a951 |
13 | 1ba7c1757c |
14 | da073da8d |
15 | 7d72cce11 |
hex | 4b69867cd |
20243310541 has 4 divisors (see below), whose sum is σ = 21434093532. Its totient is φ = 19052527552.
The previous prime is 20243310511. The next prime is 20243310559. The reversal of 20243310541 is 14501334202.
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 17471288041 + 2772022500 = 132179^2 + 52650^2 .
It is a cyclic number.
It is not a de Polignac number, because 20243310541 - 213 = 20243302349 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 (20243310511) 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 3 ways as a sum of consecutive naturals, for example, 595391470 + ... + 595391503.
It is an arithmetic number, because the mean of its divisors is an integer number (5358523383).
Almost surely, 220243310541 is an apocalyptic number.
It is an amenable number.
20243310541 is a deficient number, since it is larger than the sum of its proper divisors (1190782991).
20243310541 is a wasteful number, since it uses less digits than its factorization.
20243310541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190782990.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 20243310541 its reverse (14501334202), we get a palindrome (34744644743).
The spelling of 20243310541 in words is "twenty billion, two hundred forty-three million, three hundred ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •