Base | Representation |
---|---|
bin | 101001110000011110101… |
… | …0101100111010000011001 |
3 | 202022122122010021211110021 |
4 | 1103200331111213100121 |
5 | 1223012141434232244 |
6 | 20112301505550441 |
7 | 1131431244602014 |
oct | 123407525472031 |
9 | 22278563254407 |
10 | 5739105383449 |
11 | 1912a39409579 |
12 | 78833a945421 |
13 | 328270153549 |
14 | 15baba50037b |
15 | 9e449999284 |
hex | 5383d567419 |
5739105383449 has 3 divisors (see below), whose sum is σ = 5739107779093. Its totient is φ = 5739102987806.
The previous prime is 5739105383327. The next prime is 5739105383497. The reversal of 5739105383449 is 9443835019375.
The square root of 5739105383449 is 2395643.
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 5739105383449 - 237 = 5601666429977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5739105383149) 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, 1197822 + ... + 3593464.
Almost surely, 25739105383449 is an apocalyptic number.
5739105383449 is the 2395643-rd square number.
5739105383449 is the 1197822-nd centered octagonal number.
It is an amenable number.
5739105383449 is a deficient number, since it is larger than the sum of its proper divisors (2395644).
5739105383449 is an frugal number, since it uses more digits than its factorization.
5739105383449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4791286 (or 2395643 counting only the distinct ones).
The product of its (nonzero) digits is 48988800, while the sum is 61.
The spelling of 5739105383449 in words is "five trillion, seven hundred thirty-nine billion, one hundred five million, three hundred eighty-three thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •