Base | Representation |
---|---|
bin | 10010000011110111100… |
… | …100011010111010011111 |
3 | 11101122111200022210100102 |
4 | 102003313210122322133 |
5 | 130313240122213043 |
6 | 2350053320051315 |
7 | 155444500540163 |
oct | 22036744327237 |
9 | 4348450283312 |
10 | 1241104101023 |
11 | 439392a00616 |
12 | 18064b303b3b |
13 | 90060325787 |
14 | 440d95c0ca3 |
15 | 2243d5b86b8 |
hex | 120f791ae9f |
1241104101023 has 2 divisors, whose sum is σ = 1241104101024. Its totient is φ = 1241104101022.
The previous prime is 1241104100989. The next prime is 1241104101067. The reversal of 1241104101023 is 3201014011421.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1241104101023 - 214 = 1241104084639 is a prime.
It is a super-2 number, since 2×12411041010232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1241104100986 and 1241104101004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1241104301023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 620552050511 + 620552050512.
It is an arithmetic number, because the mean of its divisors is an integer number (620552050512).
Almost surely, 21241104101023 is an apocalyptic number.
1241104101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1241104101023 is an equidigital number, since it uses as much as digits as its factorization.
1241104101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1241104101023 its reverse (3201014011421), we get a palindrome (4442118112444).
The spelling of 1241104101023 in words is "one trillion, two hundred forty-one billion, one hundred four million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •