Base | Representation |
---|---|
bin | 100111100111000010110… |
… | …1101101001010010100001 |
3 | 201021102211102011101211001 |
4 | 1033032011231221102201 |
5 | 1203143221011234421 |
6 | 15324531315552001 |
7 | 1101212401066204 |
oct | 117160555512241 |
9 | 21242742141731 |
10 | 5443966899361 |
11 | 1809856433121 |
12 | 73b0b15bb601 |
13 | 306496587193 |
14 | 14b6bccd193b |
15 | 96923ed9691 |
hex | 4f385b694a1 |
5443966899361 has 3 divisors (see below), whose sum is σ = 5443969232593. Its totient is φ = 5443964566130.
The previous prime is 5443966899281. The next prime is 5443966899419. The reversal of 5443966899361 is 1639986693445.
The square root of 5443966899361 is 2333231.
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 5443966899361 - 231 = 5441819415713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5443966899461) 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, 1166616 + ... + 3499846.
Almost surely, 25443966899361 is an apocalyptic number.
5443966899361 is the 2333231-st square number.
5443966899361 is the 1166616-th centered octagonal number.
It is an amenable number.
5443966899361 is a deficient number, since it is larger than the sum of its proper divisors (2333232).
5443966899361 is an frugal number, since it uses more digits than its factorization.
5443966899361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4666462 (or 2333231 counting only the distinct ones).
The product of its digits is 906992640, while the sum is 73.
The spelling of 5443966899361 in words is "five trillion, four hundred forty-three billion, nine hundred sixty-six million, eight hundred ninety-nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •