Base | Representation |
---|---|
bin | 1001010000010101000010… |
… | …11100000100111100111101 |
3 | 2200001122202020110110220120 |
4 | 10220022201130010330331 |
5 | 10131422413431244131 |
6 | 111141411212205153 |
7 | 4200255030510462 |
oct | 450124134047475 |
9 | 80048666413816 |
10 | 20352263540541 |
11 | 653738a205949 |
12 | 23484a3a697b9 |
13 | b48296b0035a |
14 | 5050aa58b669 |
15 | 2546209a8496 |
hex | 1282a1704f3d |
20352263540541 has 8 divisors (see below), whose sum is σ = 28732607351424. Its totient is φ = 12770047711680.
The previous prime is 20352263540489. The next prime is 20352263540549. The reversal of 20352263540541 is 14504536225302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20352263540541 - 214 = 20352263524157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20352263540493 and 20352263540502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20352263540549) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199531995445 + ... + 199531995546.
It is an arithmetic number, because the mean of its divisors is an integer number (3591575918928).
Almost surely, 220352263540541 is an apocalyptic number.
It is an amenable number.
20352263540541 is a deficient number, since it is larger than the sum of its proper divisors (8380343810883).
20352263540541 is a wasteful number, since it uses less digits than its factorization.
20352263540541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 399063991011.
The product of its (nonzero) digits is 864000, while the sum is 42.
Adding to 20352263540541 its reverse (14504536225302), we get a palindrome (34856799765843).
The spelling of 20352263540541 in words is "twenty trillion, three hundred fifty-two billion, two hundred sixty-three million, five hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •