Base | Representation |
---|---|
bin | 1011001000000011011000… |
… | …1110101000110010101001 |
3 | 1121022110110011202222110022 |
4 | 2302000312032220302221 |
5 | 3100411114011301034 |
6 | 42003430224330225 |
7 | 2401542365004146 |
oct | 262006616506251 |
9 | 47273404688408 |
10 | 12232976665769 |
11 | 3996a81462092 |
12 | 14569bb173975 |
13 | 6a97459a8432 |
14 | 3041175993cd |
15 | 16331b4a3b2e |
hex | b20363a8ca9 |
12232976665769 has 2 divisors, whose sum is σ = 12232976665770. Its totient is φ = 12232976665768.
The previous prime is 12232976665727. The next prime is 12232976665817. The reversal of 12232976665769 is 96756667923221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11883739398400 + 349237267369 = 3447280^2 + 590963^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12232976665769 is a prime.
It is a super-2 number, since 2×122329766657692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12232976605769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116488332884 + 6116488332885.
It is an arithmetic number, because the mean of its divisors is an integer number (6116488332885).
Almost surely, 212232976665769 is an apocalyptic number.
It is an amenable number.
12232976665769 is a deficient number, since it is larger than the sum of its proper divisors (1).
12232976665769 is an equidigital number, since it uses as much as digits as its factorization.
12232976665769 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 617258880, while the sum is 71.
The spelling of 12232976665769 in words is "twelve trillion, two hundred thirty-two billion, nine hundred seventy-six million, six hundred sixty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •