Base | Representation |
---|---|
bin | 10111110110011000… |
… | …11011011101000110 |
3 | 1020001100111111212000 |
4 | 23323030123131012 |
5 | 202210343231430 |
6 | 5514320010130 |
7 | 632205350604 |
oct | 137314333506 |
9 | 36040444760 |
10 | 12804273990 |
11 | 5480751622 |
12 | 2594160946 |
13 | 1290982bb1 |
14 | 89677a874 |
15 | 4ee18de60 |
hex | 2fb31b746 |
12804273990 has 128 divisors (see below), whose sum is σ = 34584071040. Its totient is φ = 3370752000.
The previous prime is 12804273961. The next prime is 12804273997. The reversal of 12804273990 is 9937240821.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12804273997) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 16825210 + ... + 16825970.
It is an arithmetic number, because the mean of its divisors is an integer number (270188055).
Almost surely, 212804273990 is an apocalyptic number.
12804273990 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 12804273990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17292035520).
12804273990 is an abundant number, since it is smaller than the sum of its proper divisors (21779797050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12804273990 is a wasteful number, since it uses less digits than its factorization.
12804273990 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1495 (or 1489 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The spelling of 12804273990 in words is "twelve billion, eight hundred four million, two hundred seventy-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •