Base | Representation |
---|---|
bin | 10110011111010110… |
… | …00011000101001001 |
3 | 1011011110112222201012 |
4 | 23033223003011021 |
5 | 144211432244423 |
6 | 5314033533305 |
7 | 605131116542 |
oct | 131753030511 |
9 | 34143488635 |
10 | 12074103113 |
11 | 5136575416 |
12 | 240b714235 |
13 | 11a560bb17 |
14 | 8277cb4c9 |
15 | 4aa00c078 |
hex | 2cfac3149 |
12074103113 has 2 divisors, whose sum is σ = 12074103114. Its totient is φ = 12074103112.
The previous prime is 12074103077. The next prime is 12074103131. The reversal of 12074103113 is 31130147021.
It is a happy number.
12074103113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (12074103131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11553670144 + 520432969 = 107488^2 + 22813^2 .
It is a cyclic number.
It is not a de Polignac number, because 12074103113 - 218 = 12073840969 is a prime.
It is not a weakly prime, because it can be changed into another prime (12074103163) 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, 6037051556 + 6037051557.
It is an arithmetic number, because the mean of its divisors is an integer number (6037051557).
Almost surely, 212074103113 is an apocalyptic number.
It is an amenable number.
12074103113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12074103113 is an equidigital number, since it uses as much as digits as its factorization.
12074103113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The spelling of 12074103113 in words is "twelve billion, seventy-four million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •