Base | Representation |
---|---|
bin | 10110010111000111… |
… | …00001000101100000 |
3 | 1010222122120012111101 |
4 | 23023203201011200 |
5 | 144041241120000 |
6 | 5303125124144 |
7 | 603331662211 |
oct | 131343410540 |
9 | 33878505441 |
10 | 12005020000 |
11 | 5100580236 |
12 | 23b0559654 |
13 | 119420173c |
14 | 81c567408 |
15 | 4a3e12e6a |
hex | 2cb8e1160 |
12005020000 has 120 divisors (see below), whose sum is σ = 30334239936. Its totient is φ = 4671936000.
The previous prime is 12005019977. The next prime is 12005020031. The reversal of 12005020000 is 2050021.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 731889 + ... + 748111.
Almost surely, 212005020000 is an apocalyptic number.
12005020000 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 12005020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15167119968).
12005020000 is an abundant number, since it is smaller than the sum of its proper divisors (18329219936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12005020000 is an equidigital number, since it uses as much as digits as its factorization.
12005020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16290 (or 16267 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 10.
Adding to 12005020000 its reverse (2050021), we get a palindrome (12007070021).
It can be divided in two parts, 120050 and 20000, that multiplied together give a square (2401000000 = 490002).
The spelling of 12005020000 in words is "twelve billion, five million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •