Base | Representation |
---|---|
bin | 1010111010011111111011… |
… | …1101100001110101111001 |
3 | 1120111012102002010200221002 |
4 | 2232213332331201311321 |
5 | 3033102222011344433 |
6 | 41304440215454345 |
7 | 2345660122132163 |
oct | 256477675416571 |
9 | 46435362120832 |
10 | 12000121199993 |
11 | 390724a636193 |
12 | 14198543873b5 |
13 | 6907b6846a64 |
14 | 2d6b47b2b933 |
15 | 15c23d8b19e8 |
hex | ae9fef61d79 |
12000121199993 has 2 divisors, whose sum is σ = 12000121199994. Its totient is φ = 12000121199992.
The previous prime is 12000121199959. The next prime is 12000121200019. The reversal of 12000121199993 is 39999112100021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9461111595664 + 2539009604329 = 3075892^2 + 1593427^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000121199993 - 220 = 12000120151417 is a prime.
It is a super-3 number, since 3×120001211999933 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (12000121199093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000060599996 + 6000060599997.
It is an arithmetic number, because the mean of its divisors is an integer number (6000060599997).
Almost surely, 212000121199993 is an apocalyptic number.
It is an amenable number.
12000121199993 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000121199993 is an equidigital number, since it uses as much as digits as its factorization.
12000121199993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 47.
The spelling of 12000121199993 in words is "twelve trillion, one hundred twenty-one million, one hundred ninety-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •