Base | Representation |
---|---|
bin | 111001011010111101… |
… | …0111001110000111101 |
3 | 102210021202210001211011 |
4 | 1302311322321300331 |
5 | 4010020131420331 |
6 | 132352014555221 |
7 | 11623523626426 |
oct | 1626572716075 |
9 | 383252701734 |
10 | 123311201341 |
11 | 48328a5a759 |
12 | 1ba94808b11 |
13 | b8221bbcc3 |
14 | 5d7adda64d |
15 | 331aa1c3b1 |
hex | 1cb5eb9c3d |
123311201341 has 2 divisors, whose sum is σ = 123311201342. Its totient is φ = 123311201340.
The previous prime is 123311201333. The next prime is 123311201353. The reversal of 123311201341 is 143102113321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70342178841 + 52969022500 = 265221^2 + 230150^2 .
It is an emirp because it is prime and its reverse (143102113321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123311201341 - 23 = 123311201333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123311201371) 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, 61655600670 + 61655600671.
It is an arithmetic number, because the mean of its divisors is an integer number (61655600671).
Almost surely, 2123311201341 is an apocalyptic number.
It is an amenable number.
123311201341 is a deficient number, since it is larger than the sum of its proper divisors (1).
123311201341 is an equidigital number, since it uses as much as digits as its factorization.
123311201341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 123311201341 its reverse (143102113321), we get a palindrome (266413314662).
The spelling of 123311201341 in words is "one hundred twenty-three billion, three hundred eleven million, two hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •