Base | Representation |
---|---|
bin | 111001010011000000… |
… | …0110011100000101011 |
3 | 102202121011120202000122 |
4 | 1302212000303200223 |
5 | 4003443321010011 |
6 | 132305322353455 |
7 | 11614103255615 |
oct | 1624600634053 |
9 | 382534522018 |
10 | 123044313131 |
11 | 48201341693 |
12 | 1ba1b35b88b |
13 | b7abb1569c |
14 | 5d537a5db5 |
15 | 330239e3db |
hex | 1ca603382b |
123044313131 has 2 divisors, whose sum is σ = 123044313132. Its totient is φ = 123044313130.
The previous prime is 123044313127. The next prime is 123044313157. The reversal of 123044313131 is 131313440321.
It is an a-pointer prime, because the next prime (123044313157) can be obtained adding 123044313131 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 123044313131 - 22 = 123044313127 is a prime.
It is a super-2 number, since 2×1230443131312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123044313131.
It is not a weakly prime, because it can be changed into another prime (123044813131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61522156565 + 61522156566.
It is an arithmetic number, because the mean of its divisors is an integer number (61522156566).
Almost surely, 2123044313131 is an apocalyptic number.
123044313131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123044313131 is an equidigital number, since it uses as much as digits as its factorization.
123044313131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 123044313131 its reverse (131313440321), we get a palindrome (254357753452).
The spelling of 123044313131 in words is "one hundred twenty-three billion, forty-four million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •