Base | Representation |
---|---|
bin | 111001010010000110… |
… | …1001110011001000011 |
3 | 102202112001120102011021 |
4 | 1302210031032121003 |
5 | 4003413041431111 |
6 | 132302321130311 |
7 | 11613254604532 |
oct | 1624415163103 |
9 | 382461512137 |
10 | 123014014531 |
11 | 48196227921 |
12 | 1ba11189997 |
13 | b7a5767815 |
14 | 5d4d75a319 |
15 | 32ee8b6d71 |
hex | 1ca434e643 |
123014014531 has 2 divisors, whose sum is σ = 123014014532. Its totient is φ = 123014014530.
The previous prime is 123014014511. The next prime is 123014014547. The reversal of 123014014531 is 135410410321.
It is a strong prime.
It is an emirp because it is prime and its reverse (135410410321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123014014531 - 235 = 88654276163 is a prime.
It is a super-2 number, since 2×1230140145312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123014014496 and 123014014505.
It is not a weakly prime, because it can be changed into another prime (123014014511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61507007265 + 61507007266.
It is an arithmetic number, because the mean of its divisors is an integer number (61507007266).
Almost surely, 2123014014531 is an apocalyptic number.
123014014531 is a deficient number, since it is larger than the sum of its proper divisors (1).
123014014531 is an equidigital number, since it uses as much as digits as its factorization.
123014014531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 123014014531 its reverse (135410410321), we get a palindrome (258424424852).
The spelling of 123014014531 in words is "one hundred twenty-three billion, fourteen million, fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •