Base | Representation |
---|---|
bin | 110000100001… |
… | …001110011000 |
3 | 212221012012002 |
4 | 300201032120 |
5 | 11224002000 |
6 | 1132340132 |
7 | 213052430 |
oct | 60411630 |
9 | 25835162 |
10 | 12719000 |
11 | 71a7a78 |
12 | 4314648 |
13 | 2834348 |
14 | 19912c0 |
15 | 11b38d5 |
hex | c21398 |
12719000 has 128 divisors (see below), whose sum is σ = 35942400. Its totient is φ = 4118400.
The previous prime is 12718969. The next prime is 12719017. The reversal of 12719000 is 91721.
It is a super-2 number, since 2×127190002 = 323545922000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160961 + ... + 161039.
It is an arithmetic number, because the mean of its divisors is an integer number (280800).
Almost surely, 212719000 is an apocalyptic number.
12719000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12719000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17971200).
12719000 is an abundant number, since it is smaller than the sum of its proper divisors (23223400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12719000 is a wasteful number, since it uses less digits than its factorization.
12719000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130 (or 116 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 20.
The square root of 12719000 is about 3566.3707042314. The cubic root of 12719000 is about 233.4269465644.
The spelling of 12719000 in words is "twelve million, seven hundred nineteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •