Base | Representation |
---|---|
bin | 10011000100100010… |
… | …101111110101010101 |
3 | 1221212002200020200121 |
4 | 103010202233311111 |
5 | 313414142443331 |
6 | 13223535511541 |
7 | 1323306166033 |
oct | 230442576525 |
9 | 57762606617 |
10 | 20477312341 |
11 | 87589aa932 |
12 | 3b759885b1 |
13 | 1c14548185 |
14 | dc3853553 |
15 | 7ecb01c11 |
hex | 4c48afd55 |
20477312341 has 4 divisors (see below), whose sum is σ = 20562280684. Its totient is φ = 20392344000.
The previous prime is 20477312327. The next prime is 20477312411. The reversal of 20477312341 is 14321377402.
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 15692823441 + 4784488900 = 125271^2 + 69170^2 .
It is a cyclic number.
It is not a de Polignac number, because 20477312341 - 227 = 20343094613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20477312297 and 20477312306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20477612341) 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, 42483810 + ... + 42484291.
It is an arithmetic number, because the mean of its divisors is an integer number (5140570171).
Almost surely, 220477312341 is an apocalyptic number.
It is an amenable number.
20477312341 is a deficient number, since it is larger than the sum of its proper divisors (84968343).
20477312341 is an equidigital number, since it uses as much as digits as its factorization.
20477312341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84968342.
The product of its (nonzero) digits is 28224, while the sum is 34.
Adding to 20477312341 its reverse (14321377402), we get a palindrome (34798689743).
The spelling of 20477312341 in words is "twenty billion, four hundred seventy-seven million, three hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.269 sec. • engine limits •