Base | Representation |
---|---|
bin | 1001001101001111100100… |
… | …1010011011100000000001 |
3 | 1022211202112212021101100012 |
4 | 2103103321022123200001 |
5 | 2311324124020211431 |
6 | 33310255410434305 |
7 | 2063241300354026 |
oct | 223237112334001 |
9 | 38752485241305 |
10 | 10123123210241 |
11 | 3253213163228 |
12 | 1175b19592995 |
13 | 5857b6406292 |
14 | 26dd6719154d |
15 | 1284d41c922b |
hex | 934f929b801 |
10123123210241 has 2 divisors, whose sum is σ = 10123123210242. Its totient is φ = 10123123210240.
The previous prime is 10123123210159. The next prime is 10123123210259. The reversal of 10123123210241 is 14201232132101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5554199860225 + 4568923350016 = 2356735^2 + 2137504^2 .
It is a cyclic number.
It is not a de Polignac number, because 10123123210241 - 226 = 10123056101377 is a prime.
It is not a weakly prime, because it can be changed into another prime (10123123210261) 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, 5061561605120 + 5061561605121.
It is an arithmetic number, because the mean of its divisors is an integer number (5061561605121).
Almost surely, 210123123210241 is an apocalyptic number.
It is an amenable number.
10123123210241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10123123210241 is an equidigital number, since it uses as much as digits as its factorization.
10123123210241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10123123210241 its reverse (14201232132101), we get a palindrome (24324355342342).
The spelling of 10123123210241 in words is "ten trillion, one hundred twenty-three billion, one hundred twenty-three million, two hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •