Base | Representation |
---|---|
bin | 101001110010… |
… | …010011110100 |
3 | 202121112000200 |
4 | 221302103310 |
5 | 10301011342 |
6 | 1030440500 |
7 | 162051531 |
oct | 51622364 |
9 | 22545020 |
10 | 10953972 |
11 | 6201977 |
12 | 3803130 |
13 | 2366b53 |
14 | 1651d88 |
15 | e6594c |
hex | a724f4 |
10953972 has 36 divisors (see below), whose sum is σ = 27903876. Its totient is φ = 3623040.
The previous prime is 10953959. The next prime is 10953973. The reversal of 10953972 is 27935901.
10953972 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 6937956 + 4016016 = 2634^2 + 2004^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10953973) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3822 + ... + 6042.
Almost surely, 210953972 is an apocalyptic number.
10953972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10953972 is an abundant number, since it is smaller than the sum of its proper divisors (16949904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10953972 is a wasteful number, since it uses less digits than its factorization.
10953972 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2368 (or 2363 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 36.
The square root of 10953972 is about 3309.6785342386. The cubic root of 10953972 is about 222.0873773406.
The spelling of 10953972 in words is "ten million, nine hundred fifty-three thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •