Base | Representation |
---|---|
bin | 111001010101101000… |
… | …0001011110100010001 |
3 | 102202211022000102120101 |
4 | 1302223100023310101 |
5 | 4004133322342204 |
6 | 132322143012401 |
7 | 11616221460001 |
oct | 1625320136421 |
9 | 382738012511 |
10 | 123132230929 |
11 | 48246a30624 |
12 | 1ba4489a101 |
13 | b7c40b8956 |
14 | 5d61330001 |
15 | 3309e68ea4 |
hex | 1cab40bd11 |
123132230929 has 2 divisors, whose sum is σ = 123132230930. Its totient is φ = 123132230928.
The previous prime is 123132230909. The next prime is 123132231007. The reversal of 123132230929 is 929032231321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107222192704 + 15910038225 = 327448^2 + 126135^2 .
It is an emirp because it is prime and its reverse (929032231321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123132230929 - 213 = 123132222737 is a prime.
It is not a weakly prime, because it can be changed into another prime (123132230909) 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, 61566115464 + 61566115465.
It is an arithmetic number, because the mean of its divisors is an integer number (61566115465).
Almost surely, 2123132230929 is an apocalyptic number.
It is an amenable number.
123132230929 is a deficient number, since it is larger than the sum of its proper divisors (1).
123132230929 is an equidigital number, since it uses as much as digits as its factorization.
123132230929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
It can be divided in two parts, 123132 and 230929, that added together give a triangular number (354061 = T841).
The spelling of 123132230929 in words is "one hundred twenty-three billion, one hundred thirty-two million, two hundred thirty thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •