Base | Representation |
---|---|
bin | 10000010101111111111… |
… | …101100001111000000111 |
3 | 10222101000002110011212012 |
4 | 100111333331201320013 |
5 | 121400134111101411 |
6 | 2215543232244435 |
7 | 144100201351355 |
oct | 20257775417007 |
9 | 3871002404765 |
10 | 1123133300231 |
11 | 3a3355516938 |
12 | 1618070a071b |
13 | 81bac66a0c7 |
14 | 3c5079747d5 |
15 | 1e33684218b |
hex | 1057ff61e07 |
1123133300231 has 2 divisors, whose sum is σ = 1123133300232. Its totient is φ = 1123133300230.
The previous prime is 1123133300197. The next prime is 1123133300251. The reversal of 1123133300231 is 1320033313211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123133300231 is a prime.
It is a super-2 number, since 2×11231333002312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123133300197 and 1123133300206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123133300251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561566650115 + 561566650116.
It is an arithmetic number, because the mean of its divisors is an integer number (561566650116).
Almost surely, 21123133300231 is an apocalyptic number.
1123133300231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123133300231 is an equidigital number, since it uses as much as digits as its factorization.
1123133300231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1123133300231 its reverse (1320033313211), we get a palindrome (2443166613442).
The spelling of 1123133300231 in words is "one trillion, one hundred twenty-three billion, one hundred thirty-three million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •