Base | Representation |
---|---|
bin | 110100010100011011011110… |
… | …100000100101100000111011 |
3 | 1010011201120021200112010111101 |
4 | 310110123132200211200323 |
5 | 220124444013104000443 |
6 | 2133215313052312231 |
7 | 66316225526120152 |
oct | 6424333640454073 |
9 | 1104646250463441 |
10 | 230102311000123 |
11 | 67354929894061 |
12 | 21983452472677 |
13 | 9b51729c34853 |
14 | 40b7022d24599 |
15 | 1b90750de884d |
hex | d146de82583b |
230102311000123 has 2 divisors, whose sum is σ = 230102311000124. Its totient is φ = 230102311000122.
The previous prime is 230102311000103. The next prime is 230102311000139. The reversal of 230102311000123 is 321000113201032.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 230102311000123 - 29 = 230102310999611 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230102311000123.
It is not a weakly prime, because it can be changed into another prime (230102311000103) 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, 115051155500061 + 115051155500062.
It is an arithmetic number, because the mean of its divisors is an integer number (115051155500062).
Almost surely, 2230102311000123 is an apocalyptic number.
230102311000123 is a deficient number, since it is larger than the sum of its proper divisors (1).
230102311000123 is an equidigital number, since it uses as much as digits as its factorization.
230102311000123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 230102311000123 its reverse (321000113201032), we get a palindrome (551102424201155).
The spelling of 230102311000123 in words is "two hundred thirty trillion, one hundred two billion, three hundred eleven million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •