Base | Representation |
---|---|
bin | 1011000000111101110011… |
… | …1110000111001100101001 |
3 | 1120212211011202021102122122 |
4 | 2300033130332013030221 |
5 | 3041412234314433403 |
6 | 41431452342201025 |
7 | 2360002216041545 |
oct | 260173476071451 |
9 | 46784152242578 |
10 | 12111220077353 |
11 | 394a380aa4101 |
12 | 143729b123175 |
13 | 69b1108c0647 |
14 | 2dc286c3aa25 |
15 | 1600921bc838 |
hex | b03dcf87329 |
12111220077353 has 2 divisors, whose sum is σ = 12111220077354. Its totient is φ = 12111220077352.
The previous prime is 12111220077349. The next prime is 12111220077427. The reversal of 12111220077353 is 35377002211121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10255282497769 + 1855937579584 = 3202387^2 + 1362328^2 .
It is a cyclic number.
It is not a de Polignac number, because 12111220077353 - 22 = 12111220077349 is a prime.
It is not a weakly prime, because it can be changed into another prime (12111220077053) 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 as a sum of consecutive naturals, namely, 6055610038676 + 6055610038677.
It is an arithmetic number, because the mean of its divisors is an integer number (6055610038677).
Almost surely, 212111220077353 is an apocalyptic number.
It is an amenable number.
12111220077353 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111220077353 is an equidigital number, since it uses as much as digits as its factorization.
12111220077353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17640, while the sum is 35.
Adding to 12111220077353 its reverse (35377002211121), we get a palindrome (47488222288474).
The spelling of 12111220077353 in words is "twelve trillion, one hundred eleven billion, two hundred twenty million, seventy-seven thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •