Base | Representation |
---|---|
bin | 100100011110101100011… |
… | …0010111110010001001001 |
3 | 122202022021112022011212121 |
4 | 1020331120302332101021 |
5 | 1124121042421413224 |
6 | 14355134122411241 |
7 | 1025141366603311 |
oct | 110753062762111 |
9 | 18668245264777 |
10 | 5013716591689 |
11 | 166333a343953 |
12 | 68b837660b21 |
13 | 2a4a39a64300 |
14 | 134945368441 |
15 | 8a641a21be4 |
hex | 48f58cbe449 |
5013716591689 has 27 divisors (see below), whose sum is σ = 5566024599327. Its totient is φ = 4514092128000.
The previous prime is 5013716591669. The next prime is 5013716591693. The reversal of 5013716591689 is 9861956173105.
It is a happy number.
The square root of 5013716591689 is 2239133.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 2863117805625 + 2150598786064 = 1692075^2 + 1466492^2 .
It is not a de Polignac number, because 5013716591689 - 241 = 2814693336137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5013716591669) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1193455789 + ... + 1193459989.
Almost surely, 25013716591689 is an apocalyptic number.
5013716591689 is the 2239133-rd square number.
5013716591689 is the 1119567-th centered octagonal number.
It is an amenable number.
5013716591689 is a deficient number, since it is larger than the sum of its proper divisors (552308007638).
5013716591689 is an frugal number, since it uses more digits than its factorization.
5013716591689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8510 (or 4255 counting only the distinct ones).
The product of its (nonzero) digits is 12247200, while the sum is 61.
The spelling of 5013716591689 in words is "five trillion, thirteen billion, seven hundred sixteen million, five hundred ninety-one thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •