Base | Representation |
---|---|
bin | 110001100011… |
… | …100010100110 |
3 | 220102222210110 |
4 | 301203202212 |
5 | 11311200010 |
6 | 1142233450 |
7 | 215263362 |
oct | 61434246 |
9 | 26388713 |
10 | 12990630 |
11 | 7373064 |
12 | 4425886 |
13 | 28cab83 |
14 | 1a222a2 |
15 | 1219120 |
hex | c638a6 |
12990630 has 64 divisors (see below), whose sum is σ = 33136128. Its totient is φ = 3252480.
The previous prime is 12990619. The next prime is 12990631. The reversal of 12990630 is 3609921.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12990631) 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 31 ways as a sum of consecutive naturals, for example, 46090 + ... + 46370.
It is an arithmetic number, because the mean of its divisors is an integer number (517752).
Almost surely, 212990630 is an apocalyptic number.
12990630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12990630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16568064).
12990630 is an abundant number, since it is smaller than the sum of its proper divisors (20145498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12990630 is a wasteful number, since it uses less digits than its factorization.
12990630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381.
The product of its (nonzero) digits is 2916, while the sum is 30.
The square root of 12990630 is about 3604.2516560307. The cubic root of 12990630 is about 235.0769628709.
The spelling of 12990630 in words is "twelve million, nine hundred ninety thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •