Base | Representation |
---|---|
bin | 1010111011010110100011… |
… | …1101000110100101010001 |
3 | 1120112121020222111011202101 |
4 | 2232311220331012211101 |
5 | 3033322234300000441 |
6 | 41315303222320401 |
7 | 2350016362066663 |
oct | 256655075064521 |
9 | 46477228434671 |
10 | 12014784375121 |
11 | 3912494611740 |
12 | 1420666b89101 |
13 | 691cb2670748 |
14 | 2d7739314533 |
15 | 15c7ead41231 |
hex | aed68f46951 |
12014784375121 has 8 divisors (see below), whose sum is σ = 13107202704288. Its totient is φ = 10922393580000.
The previous prime is 12014784375023. The next prime is 12014784375169. The reversal of 12014784375121 is 12157348741021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12014784375121 - 213 = 12014784366929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12014784375821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5965795 + ... + 7721416.
It is an arithmetic number, because the mean of its divisors is an integer number (1638400338036).
Almost surely, 212014784375121 is an apocalyptic number.
12014784375121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12014784375121 is a deficient number, since it is larger than the sum of its proper divisors (1092418329167).
12014784375121 is a wasteful number, since it uses less digits than its factorization.
12014784375121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13767023.
The product of its (nonzero) digits is 376320, while the sum is 46.
The spelling of 12014784375121 in words is "twelve trillion, fourteen billion, seven hundred eighty-four million, three hundred seventy-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •