Base | Representation |
---|---|
bin | 10101111011110000011001… |
… | …110010000100000100000001 |
3 | 110122120000001110002221202012 |
4 | 111323300121302010010001 |
5 | 100120442113343204101 |
6 | 541055331515302305 |
7 | 26214252330066362 |
oct | 2573603162040401 |
9 | 418500043087665 |
10 | 96465398022401 |
11 | 28811822377101 |
12 | a99b78274a995 |
13 | 41a9856872a25 |
14 | 19b6d433d7b69 |
15 | b244467d9bbb |
hex | 57bc19c84101 |
96465398022401 has 2 divisors, whose sum is σ = 96465398022402. Its totient is φ = 96465398022400.
The previous prime is 96465398022397. The next prime is 96465398022407. The reversal of 96465398022401 is 10422089356469.
It is a Cunningham number, because it is equal to 98216802+1.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96465398022400 + 1 = 9821680^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 96465398022401 - 22 = 96465398022397 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (96465398022407) 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 as a sum of consecutive naturals, namely, 48232699011200 + 48232699011201.
It is an arithmetic number, because the mean of its divisors is an integer number (48232699011201).
Almost surely, 296465398022401 is an apocalyptic number.
It is an amenable number.
96465398022401 is a deficient number, since it is larger than the sum of its proper divisors (1).
96465398022401 is an equidigital number, since it uses as much as digits as its factorization.
96465398022401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22394880, while the sum is 59.
The spelling of 96465398022401 in words is "ninety-six trillion, four hundred sixty-five billion, three hundred ninety-eight million, twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •