Base | Representation |
---|---|
bin | 10110111010101010… |
… | …11001110100000001 |
3 | 1011202102211220120011 |
4 | 23131111121310001 |
5 | 200144121410311 |
6 | 5352502344521 |
7 | 613613260456 |
oct | 133525316401 |
9 | 34672756504 |
10 | 12303310081 |
11 | 5243996a67 |
12 | 247442b141 |
13 | 1210c5114a |
14 | 84a01382d |
15 | 4c01d5321 |
hex | 2dd559d01 |
12303310081 has 2 divisors, whose sum is σ = 12303310082. Its totient is φ = 12303310080.
The previous prime is 12303310079. The next prime is 12303310093. The reversal of 12303310081 is 18001330321.
12303310081 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10669857025 + 1633453056 = 103295^2 + 40416^2 .
It is a cyclic number.
It is not a de Polignac number, because 12303310081 - 21 = 12303310079 is a prime.
It is a super-2 number, since 2×123033100812 (a number of 21 digits) contains 22 as substring.
Together with 12303310079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12303310021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6151655040 + 6151655041.
It is an arithmetic number, because the mean of its divisors is an integer number (6151655041).
Almost surely, 212303310081 is an apocalyptic number.
It is an amenable number.
12303310081 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303310081 is an equidigital number, since it uses as much as digits as its factorization.
12303310081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 12303310081 in words is "twelve billion, three hundred three million, three hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •