Base | Representation |
---|---|
bin | 101100111001101100… |
… | …1100011001010101001 |
3 | 100012220001022201021022 |
4 | 1121303121203022221 |
5 | 3034434342423433 |
6 | 112144110022225 |
7 | 6652340006456 |
oct | 1316331431251 |
9 | 305801281238 |
10 | 96425357993 |
11 | 37991667708 |
12 | 168307a7975 |
13 | 912906a763 |
14 | 494a3d282d |
15 | 27954d6698 |
hex | 16736632a9 |
96425357993 has 4 divisors (see below), whose sum is σ = 96426719748. Its totient is φ = 96423996240.
The previous prime is 96425357933. The next prime is 96425358013. The reversal of 96425357993 is 39975352469.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38348213929 + 58077144064 = 195827^2 + 240992^2 .
It is a cyclic number.
It is not a de Polignac number, because 96425357993 - 214 = 96425341609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (96425357933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 568478 + ... + 718343.
It is an arithmetic number, because the mean of its divisors is an integer number (24106679937).
Almost surely, 296425357993 is an apocalyptic number.
It is an amenable number.
96425357993 is a deficient number, since it is larger than the sum of its proper divisors (1361755).
96425357993 is a wasteful number, since it uses less digits than its factorization.
96425357993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1361754.
The product of its digits is 55112400, while the sum is 62.
It can be divided in two parts, 9642 and 5357993, that added together give a palindrome (5367635).
The spelling of 96425357993 in words is "ninety-six billion, four hundred twenty-five million, three hundred fifty-seven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •