Base | Representation |
---|---|
bin | 1010111011000100100001… |
… | …1010111011000001001011 |
3 | 1120112010202121200010122011 |
4 | 2232301020122323001023 |
5 | 3033232331023423101 |
6 | 41313143015240351 |
7 | 2346455412014626 |
oct | 256611032730113 |
9 | 46463677603564 |
10 | 12009943576651 |
11 | 3910430061149 |
12 | 141b7359790b7 |
13 | 6916c07b3057 |
14 | 2d73da454dbd |
15 | 15c615d85751 |
hex | aec486bb04b |
12009943576651 has 2 divisors, whose sum is σ = 12009943576652. Its totient is φ = 12009943576650.
The previous prime is 12009943576627. The next prime is 12009943576663. The reversal of 12009943576651 is 15667534990021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12009943576651 - 213 = 12009943568459 is a prime.
It is a super-2 number, since 2×120099435766512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12009943556651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6004971788325 + 6004971788326.
It is an arithmetic number, because the mean of its divisors is an integer number (6004971788326).
Almost surely, 212009943576651 is an apocalyptic number.
12009943576651 is a deficient number, since it is larger than the sum of its proper divisors (1).
12009943576651 is an equidigital number, since it uses as much as digits as its factorization.
12009943576651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12247200, while the sum is 58.
The spelling of 12009943576651 in words is "twelve trillion, nine billion, nine hundred forty-three million, five hundred seventy-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •