Base | Representation |
---|---|
bin | 1110110000000… |
… | …10000100001111 |
3 | 22121211122221221 |
4 | 13120002010033 |
5 | 223134143211 |
6 | 20140104211 |
7 | 3031530163 |
oct | 730020417 |
9 | 277748857 |
10 | 123740431 |
11 | 63937021 |
12 | 35535067 |
13 | 1c8365b9 |
14 | 12610ca3 |
15 | ace3c71 |
hex | 760210f |
123740431 has 2 divisors, whose sum is σ = 123740432. Its totient is φ = 123740430.
The previous prime is 123740417. The next prime is 123740443. The reversal of 123740431 is 134047321.
It is a strong prime.
It is an emirp because it is prime and its reverse (134047321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123740431 - 29 = 123739919 is a prime.
It is a super-2 number, since 2×1237404312 = 30623388528131522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123740396 and 123740405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123740401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61870215 + 61870216.
It is an arithmetic number, because the mean of its divisors is an integer number (61870216).
Almost surely, 2123740431 is an apocalyptic number.
123740431 is a deficient number, since it is larger than the sum of its proper divisors (1).
123740431 is an equidigital number, since it uses as much as digits as its factorization.
123740431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 25.
The square root of 123740431 is about 11123.8676277633. The cubic root of 123740431 is about 498.3149019356.
Adding to 123740431 its reverse (134047321), we get a palindrome (257787752).
The spelling of 123740431 in words is "one hundred twenty-three million, seven hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.558 sec. • engine limits •