Base | Representation |
---|---|
bin | 1010111011110111000101… |
… | …0000101100000011011101 |
3 | 1120120102210100011212201021 |
4 | 2232331301100230003131 |
5 | 3033443123444133121 |
6 | 41323305333244141 |
7 | 2350445606565655 |
oct | 256756120540335 |
9 | 46512710155637 |
10 | 12023513661661 |
11 | 3916164011937 |
12 | 14222a2493651 |
13 | 692a74008258 |
14 | 2d7d267bb365 |
15 | 15cb5c396641 |
hex | aef7142c0dd |
12023513661661 has 2 divisors, whose sum is σ = 12023513661662. Its totient is φ = 12023513661660.
The previous prime is 12023513661647. The next prime is 12023513661667. The reversal of 12023513661661 is 16616631532021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12020047396036 + 3466265625 = 3466994^2 + 58875^2 .
It is an emirp because it is prime and its reverse (16616631532021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12023513661661 - 25 = 12023513661629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12023513661667) 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, 6011756830830 + 6011756830831.
It is an arithmetic number, because the mean of its divisors is an integer number (6011756830831).
Almost surely, 212023513661661 is an apocalyptic number.
It is an amenable number.
12023513661661 is a deficient number, since it is larger than the sum of its proper divisors (1).
12023513661661 is an equidigital number, since it uses as much as digits as its factorization.
12023513661661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 12023513661661 in words is "twelve trillion, twenty-three billion, five hundred thirteen million, six hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •