Base | Representation |
---|---|
bin | 1010111110100101110010… |
… | …0101001101011101111101 |
3 | 1120201220211201110210200020 |
4 | 2233221130211031131331 |
5 | 3040230200302011000 |
6 | 41401023113522353 |
7 | 2354026021466556 |
oct | 257513445153575 |
9 | 46656751423606 |
10 | 12070411360125 |
11 | 393403a5a0918 |
12 | 142b3b04133b9 |
13 | 6973091254a1 |
14 | 2da2d50b532d |
15 | 15dea46daba0 |
hex | afa5c94d77d |
12070411360125 has 16 divisors (see below), whose sum is σ = 20085164503872. Its totient is φ = 6437552725200.
The previous prime is 12070411360123. The next prime is 12070411360141. The reversal of 12070411360125 is 52106311407021.
It is not a de Polignac number, because 12070411360125 - 21 = 12070411360123 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12070411360123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16093881439 + ... + 16093882188.
It is an arithmetic number, because the mean of its divisors is an integer number (1255322781492).
Almost surely, 212070411360125 is an apocalyptic number.
12070411360125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12070411360125 is a deficient number, since it is larger than the sum of its proper divisors (8014753143747).
12070411360125 is an equidigital number, since it uses as much as digits as its factorization.
12070411360125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32187763645 (or 32187763635 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
Adding to 12070411360125 its reverse (52106311407021), we get a palindrome (64176722767146).
The spelling of 12070411360125 in words is "twelve trillion, seventy billion, four hundred eleven million, three hundred sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •