Base | Representation |
---|---|
bin | 100111000000… |
… | …110010000000 |
3 | 201020120112222 |
4 | 213000302000 |
5 | 10104224231 |
6 | 1003110212 |
7 | 152632535 |
oct | 47006200 |
9 | 21216488 |
10 | 10226816 |
11 | 5855616 |
12 | 3512368 |
13 | 2170b92 |
14 | 1502d8c |
15 | d7027b |
hex | 9c0c80 |
10226816 has 32 divisors (see below), whose sum is σ = 20588700. Its totient is φ = 5059584.
The previous prime is 10226791. The next prime is 10226831. The reversal of 10226816 is 61862201.
It can be written as a sum of positive squares in 2 ways, for example, as 8526400 + 1700416 = 2920^2 + 1304^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13586 + ... + 14318.
Almost surely, 210226816 is an apocalyptic number.
10226816 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 10226816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10294350).
10226816 is an abundant number, since it is smaller than the sum of its proper divisors (10361884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10226816 is an equidigital number, since it uses as much as digits as its factorization.
10226816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 856 (or 844 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 10226816 is about 3197.9393365103. The cubic root of 10226816 is about 217.0601742979.
The spelling of 10226816 in words is "ten million, two hundred twenty-six thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •