Base | Representation |
---|---|
bin | 100011011001001110011010… |
… | …1111110101001011001111011 |
3 | 1111211022212122221011020212201 |
4 | 1012302130311332221121323 |
5 | 311301313222200000443 |
6 | 3022051041443451031 |
7 | 122401602404442463 |
oct | 10662346576513173 |
9 | 1454285587136781 |
10 | 311330200000123 |
11 | 9022143a5a1817 |
12 | 2ab01a66086a77 |
13 | 104944092a6c15 |
14 | 56c4667d3aba3 |
15 | 25ed62db5a34d |
hex | 11b2735fa967b |
311330200000123 has 2 divisors, whose sum is σ = 311330200000124. Its totient is φ = 311330200000122.
The previous prime is 311330200000103. The next prime is 311330200000151. The reversal of 311330200000123 is 321000002033113.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 311330200000123 - 225 = 311330166445691 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 311330200000123.
It is not a weakly prime, because it can be changed into another prime (311330200000103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155665100000061 + 155665100000062.
It is an arithmetic number, because the mean of its divisors is an integer number (155665100000062).
Almost surely, 2311330200000123 is an apocalyptic number.
311330200000123 is a deficient number, since it is larger than the sum of its proper divisors (1).
311330200000123 is an equidigital number, since it uses as much as digits as its factorization.
311330200000123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 311330200000123 its reverse (321000002033113), we get a palindrome (632330202033236).
The spelling of 311330200000123 in words is "three hundred eleven trillion, three hundred thirty billion, two hundred million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •