Base | Representation |
---|---|
bin | 101100100011111111… |
… | …0010101011111011001 |
3 | 100011000021102022210201 |
4 | 1121013332111133121 |
5 | 3031441340210201 |
6 | 111543522342201 |
7 | 6625312260664 |
oct | 1310776253731 |
9 | 304007368721 |
10 | 95696803801 |
11 | 37648395105 |
12 | 166687ba961 |
13 | 90411414c1 |
14 | 48bb7446db |
15 | 2751573801 |
hex | 1647f957d9 |
95696803801 has 27 divisors (see below), whose sum is σ = 105221456607. Its totient is φ = 87013686720.
The previous prime is 95696803799. The next prime is 95696803819. The reversal of 95696803801 is 10830869659.
It is a happy number.
The square root of 95696803801 is 309349.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 74504432025 + 21192371776 = 272955^2 + 145576^2 .
It is not a de Polignac number, because 95696803801 - 21 = 95696803799 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (95696803831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 163026630 + ... + 163027216.
Almost surely, 295696803801 is an apocalyptic number.
95696803801 is the 309349-th square number.
95696803801 is the 154675-th centered octagonal number.
It is an amenable number.
95696803801 is a deficient number, since it is larger than the sum of its proper divisors (9524652806).
95696803801 is an frugal number, since it uses more digits than its factorization.
95696803801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270 (or 635 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 55.
The spelling of 95696803801 in words is "ninety-five billion, six hundred ninety-six million, eight hundred three thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •