Base | Representation |
---|---|
bin | 101101101000… |
… | …101000111100 |
3 | 211111210001212 |
4 | 231220220330 |
5 | 11030303230 |
6 | 1104223552 |
7 | 203453243 |
oct | 55505074 |
9 | 24453055 |
10 | 11962940 |
11 | 6830a30 |
12 | 400abb8 |
13 | 262b182 |
14 | 183595a |
15 | 10b4895 |
hex | b68a3c |
11962940 has 24 divisors (see below), whose sum is σ = 27406512. Its totient is φ = 4350080.
The previous prime is 11962823. The next prime is 11962943. The reversal of 11962940 is 4926911.
11962940 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×119629402 = 286223866887200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11962897 and 11962906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11962943) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26969 + ... + 27408.
It is an arithmetic number, because the mean of its divisors is an integer number (1141938).
Almost surely, 211962940 is an apocalyptic number.
11962940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11962940 is an abundant number, since it is smaller than the sum of its proper divisors (15443572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11962940 is a wasteful number, since it uses less digits than its factorization.
11962940 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54397 (or 54395 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 11962940 is about 3458.7483285142. The cubic root of 11962940 is about 228.7069215265.
The spelling of 11962940 in words is "eleven million, nine hundred sixty-two thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •