Base | Representation |
---|---|
bin | 10111001011100000… |
… | …00111110101010010 |
3 | 1012010021120201200110 |
4 | 23211300013311102 |
5 | 200441300011200 |
6 | 5414505302150 |
7 | 620246530356 |
oct | 134560076522 |
9 | 35107521613 |
10 | 12444532050 |
11 | 5306683135 |
12 | 24b3794956 |
13 | 1234298742 |
14 | 860a95466 |
15 | 4cc7cdb50 |
hex | 2e5c07d52 |
12444532050 has 48 divisors (see below), whose sum is σ = 30893951232. Its totient is φ = 3315153600.
The previous prime is 12444532039. The next prime is 12444532073. The reversal of 12444532050 is 5023544421.
12444532050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 12444531999 and 12444532017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106792 + ... + 190508.
It is an arithmetic number, because the mean of its divisors is an integer number (643623984).
Almost surely, 212444532050 is an apocalyptic number.
12444532050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12444532050 is an abundant number, since it is smaller than the sum of its proper divisors (18449419182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12444532050 is a wasteful number, since it uses less digits than its factorization.
12444532050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84723 (or 84718 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The spelling of 12444532050 in words is "twelve billion, four hundred forty-four million, five hundred thirty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •