Base | Representation |
---|---|
bin | 1011010111110110001010… |
… | …0011010001110111100011 |
3 | 1122021101210101112201222011 |
4 | 2311331202203101313203 |
5 | 3114332303110322201 |
6 | 42332221514053351 |
7 | 2430256201422415 |
oct | 265754243216743 |
9 | 48241711481864 |
10 | 12504303214051 |
11 | 3a910551a5750 |
12 | 149b501a1a257 |
13 | 6c91c6213a5c |
14 | 3132d65249b5 |
15 | 16a3eb720151 |
hex | b5f628d1de3 |
12504303214051 has 4 divisors (see below), whose sum is σ = 13641058051704. Its totient is φ = 11367548376400.
The previous prime is 12504303214027. The next prime is 12504303214063. The reversal of 12504303214051 is 15041230340521.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12504303214051 - 217 = 12504303082979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12504303214001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 568377418810 + ... + 568377418831.
It is an arithmetic number, because the mean of its divisors is an integer number (3410264512926).
Almost surely, 212504303214051 is an apocalyptic number.
12504303214051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12504303214051 is a deficient number, since it is larger than the sum of its proper divisors (1136754837653).
12504303214051 is a wasteful number, since it uses less digits than its factorization.
12504303214051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1136754837652.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 12504303214051 its reverse (15041230340521), we get a palindrome (27545533554572).
The spelling of 12504303214051 in words is "twelve trillion, five hundred four billion, three hundred three million, two hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •