Base | Representation |
---|---|
bin | 111001011011100011… |
… | …0100010110001110001 |
3 | 102210100011002110210201 |
4 | 1302313012202301301 |
5 | 4010040220431004 |
6 | 132354003555201 |
7 | 11624154313336 |
oct | 1626706426161 |
9 | 383304073721 |
10 | 123331030129 |
11 | 4833917338a |
12 | 1ba9b38bb01 |
13 | b826342508 |
14 | 5d7d8bc98d |
15 | 331c6376a4 |
hex | 1cb71a2c71 |
123331030129 has 2 divisors, whose sum is σ = 123331030130. Its totient is φ = 123331030128.
The previous prime is 123331030117. The next prime is 123331030153. The reversal of 123331030129 is 921030133321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84594885904 + 38736144225 = 290852^2 + 196815^2 .
It is an emirp because it is prime and its reverse (921030133321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123331030129 - 27 = 123331030001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123331030097 and 123331030106.
It is not a weakly prime, because it can be changed into another prime (123331030159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61665515064 + 61665515065.
It is an arithmetic number, because the mean of its divisors is an integer number (61665515065).
Almost surely, 2123331030129 is an apocalyptic number.
It is an amenable number.
123331030129 is a deficient number, since it is larger than the sum of its proper divisors (1).
123331030129 is an equidigital number, since it uses as much as digits as its factorization.
123331030129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 123331030129 in words is "one hundred twenty-three billion, three hundred thirty-one million, thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •