Base | Representation |
---|---|
bin | 110001001101… |
… | …111000101100 |
3 | 220021111010100 |
4 | 301031320230 |
5 | 11300330212 |
6 | 1140311100 |
7 | 214443651 |
oct | 61157054 |
9 | 26244110 |
10 | 12901932 |
11 | 731245a |
12 | 43a2490 |
13 | 28996a4 |
14 | 19dbc28 |
15 | 11ecbdc |
hex | c4de2c |
12901932 has 36 divisors (see below), whose sum is σ = 32727240. Its totient is φ = 4285632.
The previous prime is 12901913. The next prime is 12901951. The reversal of 12901932 is 23910921.
12901932 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12901913) and next prime (12901951).
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 12901896 and 12901905.
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, 15544 + ... + 16352.
It is an arithmetic number, because the mean of its divisors is an integer number (909090).
Almost surely, 212901932 is an apocalyptic number.
12901932 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12901932 is an abundant number, since it is smaller than the sum of its proper divisors (19825308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12901932 is a wasteful number, since it uses less digits than its factorization.
12901932 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1262 (or 1257 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 12901932 is about 3591.9259457845. The cubic root of 12901932 is about 234.5407175732.
The spelling of 12901932 in words is "twelve million, nine hundred one thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •