Base | Representation |
---|---|
bin | 101001110100… |
… | …000011101100 |
3 | 202121212211212 |
4 | 221310003230 |
5 | 10301224012 |
6 | 1030533552 |
7 | 162111440 |
oct | 51640354 |
9 | 22555755 |
10 | 10961132 |
11 | 6207296 |
12 | 38072b8 |
13 | 236a1a0 |
14 | 1654820 |
15 | e67b22 |
hex | a740ec |
10961132 has 24 divisors (see below), whose sum is σ = 23609376. Its totient is φ = 4336128.
The previous prime is 10961131. The next prime is 10961143. The reversal of 10961132 is 23116901.
It is a happy number.
It is a Smith number, since the sum of its digits (23) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 10961098 and 10961107.
It is not an unprimeable number, because it can be changed into a prime (10961131) 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 7 ways as a sum of consecutive naturals, for example, 14693 + ... + 15420.
It is an arithmetic number, because the mean of its divisors is an integer number (983724).
Almost surely, 210961132 is an apocalyptic number.
It is an amenable number.
10961132 is an abundant number, since it is smaller than the sum of its proper divisors (12648244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10961132 is a wasteful number, since it uses less digits than its factorization.
10961132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30137 (or 30135 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
The square root of 10961132 is about 3310.7600335875. The cubic root of 10961132 is about 222.1357555083.
The spelling of 10961132 in words is "ten million, nine hundred sixty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •