Base | Representation |
---|---|
bin | 10110100011011101… |
… | …01101000101100001 |
3 | 1011020212111102112111 |
4 | 23101232231011201 |
5 | 144244301203113 |
6 | 5321305355321 |
7 | 606030352363 |
oct | 132156550541 |
9 | 34225442474 |
10 | 12108616033 |
11 | 5153aa8498 |
12 | 241b198b41 |
13 | 11ac803c77 |
14 | 82c212d33 |
15 | 4ad07813d |
hex | 2d1bad161 |
12108616033 has 2 divisors, whose sum is σ = 12108616034. Its totient is φ = 12108616032.
The previous prime is 12108616031. The next prime is 12108616057. The reversal of 12108616033 is 33061680121.
12108616033 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., 11476194129 + 632421904 = 107127^2 + 25148^2 .
It is a cyclic number.
It is not a de Polignac number, because 12108616033 - 21 = 12108616031 is a prime.
Together with 12108616031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12108615986 and 12108616004.
It is not a weakly prime, because it can be changed into another prime (12108616031) 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, 6054308016 + 6054308017.
It is an arithmetic number, because the mean of its divisors is an integer number (6054308017).
Almost surely, 212108616033 is an apocalyptic number.
It is an amenable number.
12108616033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12108616033 is an equidigital number, since it uses as much as digits as its factorization.
12108616033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 12108616033 in words is "twelve billion, one hundred eight million, six hundred sixteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •