Base | Representation |
---|---|
bin | 101101001000010100… |
… | …0001001111011011001 |
3 | 100021011020000222202212 |
4 | 1122100220021323121 |
5 | 3041440411213131 |
6 | 112304504204505 |
7 | 10000443036101 |
oct | 1322050117331 |
9 | 307136028685 |
10 | 96915726041 |
11 | 38113445462 |
12 | 16948a69735 |
13 | 91a682c674 |
14 | 499559c201 |
15 | 27c359aa2b |
hex | 1690a09ed9 |
96915726041 has 4 divisors (see below), whose sum is σ = 96918895284. Its totient is φ = 96912556800.
The previous prime is 96915726013. The next prime is 96915726049. The reversal of 96915726041 is 14062751969.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14062751969 = 7 ⋅2008964567.
It can be written as a sum of positive squares in 2 ways, for example, as 85861306441 + 11054419600 = 293021^2 + 105140^2 .
It is a cyclic number.
It is not a de Polignac number, because 96915726041 - 222 = 96911531737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (96915726049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1538300 + ... + 1600061.
It is an arithmetic number, because the mean of its divisors is an integer number (24229723821).
Almost surely, 296915726041 is an apocalyptic number.
It is an amenable number.
96915726041 is a deficient number, since it is larger than the sum of its proper divisors (3169243).
96915726041 is a wasteful number, since it uses less digits than its factorization.
96915726041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3169242.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 96915726041 in words is "ninety-six billion, nine hundred fifteen million, seven hundred twenty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •