Base | Representation |
---|---|
bin | 101100101101110110… |
… | …0001110100001010101 |
3 | 100011212022212120020010 |
4 | 1121123230032201111 |
5 | 3033131031212411 |
6 | 112040420430433 |
7 | 6636440066154 |
oct | 1313354164125 |
9 | 304768776203 |
10 | 96027600981 |
11 | 377a8093a04 |
12 | 1673b548419 |
13 | 9094833090 |
14 | 490d65359b |
15 | 27706177a6 |
hex | 165bb0e855 |
96027600981 has 8 divisors (see below), whose sum is σ = 137885786080. Its totient is φ = 59093908272.
The previous prime is 96027600973. The next prime is 96027600983. The reversal of 96027600981 is 18900672069.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 96027600981 - 23 = 96027600973 is a prime.
It is a super-2 number, since 2×960276009812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 96027600981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96027600983) 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 7 ways as a sum of consecutive naturals, for example, 1231123051 + ... + 1231123128.
It is an arithmetic number, because the mean of its divisors is an integer number (17235723260).
Almost surely, 296027600981 is an apocalyptic number.
It is an amenable number.
96027600981 is a deficient number, since it is larger than the sum of its proper divisors (41858185099).
96027600981 is a wasteful number, since it uses less digits than its factorization.
96027600981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2462246195.
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 96027600981 in words is "ninety-six billion, twenty-seven million, six hundred thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.134 sec. • engine limits •