Base | Representation |
---|---|
bin | 101001100100… |
… | …111101100000 |
3 | 202111202000122 |
4 | 221210331200 |
5 | 10242234141 |
6 | 1025335412 |
7 | 161433242 |
oct | 51447540 |
9 | 22452018 |
10 | 10899296 |
11 | 6174891 |
12 | 3797568 |
13 | 2347cb5 |
14 | 163a092 |
15 | e5464b |
hex | a64f60 |
10899296 has 36 divisors (see below), whose sum is σ = 22206492. Its totient is φ = 5263104.
The previous prime is 10899283. The next prime is 10899299. The reversal of 10899296 is 69299801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10899299) 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 5 ways as a sum of consecutive naturals, for example, 122420 + ... + 122508.
It is an arithmetic number, because the mean of its divisors is an integer number (616847).
Almost surely, 210899296 is an apocalyptic number.
10899296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10899296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11103246).
10899296 is an abundant number, since it is smaller than the sum of its proper divisors (11307196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10899296 is an frugal number, since it uses more digits than its factorization.
10899296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 44.
The square root of 10899296 is about 3301.4081843965. The cubic root of 10899296 is about 221.7172495289.
The spelling of 10899296 in words is "ten million, eight hundred ninety-nine thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •