Base | Representation |
---|---|
bin | 10001010000100110… |
… | …10001010100010000 |
3 | 212220202202101011010 |
4 | 20220103101110100 |
5 | 122434103344041 |
6 | 4131244050520 |
7 | 445423223421 |
oct | 105023212420 |
9 | 25822671133 |
10 | 9266074896 |
11 | 3a25504241 |
12 | 1967233a40 |
13 | b48930670 |
14 | 63c8b7648 |
15 | 393738a16 |
hex | 2284d1510 |
9266074896 has 160 divisors (see below), whose sum is σ = 26748288000. Its totient is φ = 2744469504.
The previous prime is 9266074891. The next prime is 9266074921. The reversal of 9266074896 is 6984706629.
It is not an unprimeable number, because it can be changed into a prime (9266074891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8667450 + ... + 8668518.
It is an arithmetic number, because the mean of its divisors is an integer number (167176800).
Almost surely, 29266074896 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 9266074896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13374144000).
9266074896 is an abundant number, since it is smaller than the sum of its proper divisors (17482213104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9266074896 is a wasteful number, since it uses less digits than its factorization.
9266074896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1601 (or 1595 counting only the distinct ones).
The product of its (nonzero) digits is 7838208, while the sum is 57.
The square root of 9266074896 is about 96260.4534375358. The cubic root of 9266074896 is about 2100.3835199767.
The spelling of 9266074896 in words is "nine billion, two hundred sixty-six million, seventy-four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •