Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …1000110110110110001001 |
3 | 1120112100100010012101021022 |
4 | 2232303021020312312021 |
5 | 3033301241343224313 |
6 | 41314141201322225 |
7 | 2346563053460462 |
oct | 256631110666611 |
9 | 46470303171238 |
10 | 12012103101833 |
11 | 39113390563aa |
12 | 1420039036375 |
13 | 6919760129c3 |
14 | 2d7563197d69 |
15 | 15c6e0759c08 |
hex | aecc9236d89 |
12012103101833 has 2 divisors, whose sum is σ = 12012103101834. Its totient is φ = 12012103101832.
The previous prime is 12012103101811. The next prime is 12012103101847. The reversal of 12012103101833 is 33810130121021.
12012103101833 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11938427771209 + 73675330624 = 3455203^2 + 271432^2 .
It is a cyclic number.
It is not a de Polignac number, because 12012103101833 - 214 = 12012103085449 is a prime.
It is not a weakly prime, because it can be changed into another prime (12012103101133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006051550916 + 6006051550917.
It is an arithmetic number, because the mean of its divisors is an integer number (6006051550917).
Almost surely, 212012103101833 is an apocalyptic number.
It is an amenable number.
12012103101833 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012103101833 is an equidigital number, since it uses as much as digits as its factorization.
12012103101833 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 12012103101833 its reverse (33810130121021), we get a palindrome (45822233222854).
The spelling of 12012103101833 in words is "twelve trillion, twelve billion, one hundred three million, one hundred one thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •