Base | Representation |
---|---|
bin | 1001010111011011101000… |
… | …11010001000101000101001 |
3 | 2200220222201000222202221221 |
4 | 10223231310122020220221 |
5 | 10144422231211124424 |
6 | 111445452550502041 |
7 | 4224015016356400 |
oct | 453556432105051 |
9 | 80828630882857 |
10 | 20596321192489 |
11 | 662093a406049 |
12 | 2387856364921 |
13 | b652bca2a763 |
14 | 512c1daba637 |
15 | 25ab56c769e4 |
hex | 12bb74688a29 |
20596321192489 has 9 divisors (see below), whose sum is σ = 23959022831901. Its totient is φ = 17653962363660.
The previous prime is 20596321192483. The next prime is 20596321192537. The reversal of 20596321192489 is 98429112369502.
The square root of 20596321192489 is 4538317.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 20596321192489 - 29 = 20596321191977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20596321192483) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 31444054 + ... + 32092384.
It is an arithmetic number, because the mean of its divisors is an integer number (2662113647989).
Almost surely, 220596321192489 is an apocalyptic number.
20596321192489 is the 4538317-th square number.
20596321192489 is the 2269159-th centered octagonal number.
It is an amenable number.
20596321192489 is a deficient number, since it is larger than the sum of its proper divisors (3362701639412).
20596321192489 is an frugal number, since it uses more digits than its factorization.
20596321192489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1296676 (or 648338 counting only the distinct ones).
The product of its (nonzero) digits is 16796160, while the sum is 61.
The spelling of 20596321192489 in words is "twenty trillion, five hundred ninety-six billion, three hundred twenty-one million, one hundred ninety-two thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •