Base | Representation |
---|---|
bin | 101101000001101101… |
… | …0111010000111000010 |
3 | 100020120210002201222220 |
4 | 1122003122322013002 |
5 | 3041012200241240 |
6 | 112230511111510 |
7 | 6662112465414 |
oct | 1320332720702 |
9 | 306523081886 |
10 | 96694149570 |
11 | 3800a365807 |
12 | 168a6812596 |
13 | 916c95c525 |
14 | 4973da09b4 |
15 | 27addcd5d0 |
hex | 16836ba1c2 |
96694149570 has 32 divisors (see below), whose sum is σ = 232125098112. Its totient is φ = 25778535552.
The previous prime is 96694149527. The next prime is 96694149577. The reversal of 96694149570 is 7594149669.
It is a super-2 number, since 2×966941495702 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (96694149577) 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 15 ways as a sum of consecutive naturals, for example, 290427 + ... + 527006.
It is an arithmetic number, because the mean of its divisors is an integer number (7253909316).
Almost surely, 296694149570 is an apocalyptic number.
96694149570 is an abundant number, since it is smaller than the sum of its proper divisors (135430948542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96694149570 is a wasteful number, since it uses less digits than its factorization.
96694149570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 821386.
The product of its (nonzero) digits is 14696640, while the sum is 60.
The spelling of 96694149570 in words is "ninety-six billion, six hundred ninety-four million, one hundred forty-nine thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •