Base | Representation |
---|---|
bin | 1011000111101100… |
… | …11101101111101001 |
3 | 120102001222001001211 |
4 | 11203312131233221 |
5 | 44211332024124 |
6 | 2424225513121 |
7 | 300642525451 |
oct | 54366355751 |
9 | 16361861054 |
10 | 5970189289 |
11 | 259401a639 |
12 | 11a74a27a1 |
13 | 741b5bcac |
14 | 408c8cd61 |
15 | 24e1e9e94 |
hex | 163d9dbe9 |
5970189289 has 3 divisors (see below), whose sum is σ = 5970266557. Its totient is φ = 5970112022.
The previous prime is 5970189287. The next prime is 5970189299. The reversal of 5970189289 is 9829810795.
The square root of 5970189289 is 77267.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 5970189289 - 21 = 5970189287 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5970189287) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 38634 + ... + 115900.
Almost surely, 25970189289 is an apocalyptic number.
5970189289 is the 77267-th square number.
5970189289 is the 38634-th centered octagonal number.
It is an amenable number.
5970189289 is a deficient number, since it is larger than the sum of its proper divisors (77268).
5970189289 is an frugal number, since it uses more digits than its factorization.
5970189289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154534 (or 77267 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 58.
The cubic root of 5970189289 is about 1814.1061695872.
The spelling of 5970189289 in words is "five billion, nine hundred seventy million, one hundred eighty-nine thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •