Base | Representation |
---|---|
bin | 101110011001… |
… | …000101111000 |
3 | 211212212022020 |
4 | 232121011320 |
5 | 11103131100 |
6 | 1112354440 |
7 | 205240656 |
oct | 56310570 |
9 | 24785266 |
10 | 12161400 |
11 | 6957049 |
12 | 40a5a20 |
13 | 269a5c4 |
14 | 1887dd6 |
15 | 11035a0 |
hex | b99178 |
12161400 has 48 divisors (see below), whose sum is σ = 37702200. Its totient is φ = 3242880.
The previous prime is 12161351. The next prime is 12161417. The reversal of 12161400 is 416121.
12161400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12161400.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9535 + ... + 10734.
Almost surely, 212161400 is an apocalyptic number.
12161400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12161400 is an abundant number, since it is smaller than the sum of its proper divisors (25540800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12161400 is a wasteful number, since it uses less digits than its factorization.
12161400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20288 (or 20279 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 12161400 is about 3487.3198878222. The cubic root of 12161400 is about 229.9647078804.
Adding to 12161400 its reverse (416121), we get a palindrome (12577521).
It can be divided in two parts, 12161 and 400, that added together give a triangular number (12561 = T158).
The spelling of 12161400 in words is "twelve million, one hundred sixty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •