Base | Representation |
---|---|
bin | 10010000011111000100… |
… | …100111011100101001001 |
3 | 11101122112212010221220102 |
4 | 102003320210323211021 |
5 | 130313303434341131 |
6 | 2350055122335145 |
7 | 155445064352351 |
oct | 22037044734511 |
9 | 4348485127812 |
10 | 1241121012041 |
11 | 4393a1501069 |
12 | 180654aba4b5 |
13 | 90063996bb1 |
14 | 440db943b61 |
15 | 2243ed091cb |
hex | 120f893b949 |
1241121012041 has 4 divisors (see below), whose sum is σ = 1241206603392. Its totient is φ = 1241035420692.
The previous prime is 1241121012037. The next prime is 1241121012073. The reversal of 1241121012041 is 1402101211421.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1241121012041 - 22 = 1241121012037 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1241121012011) 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 in 3 ways as a sum of consecutive naturals, for example, 42773921 + ... + 42802926.
It is an arithmetic number, because the mean of its divisors is an integer number (310301650848).
Almost surely, 21241121012041 is an apocalyptic number.
It is an amenable number.
1241121012041 is a deficient number, since it is larger than the sum of its proper divisors (85591351).
1241121012041 is an equidigital number, since it uses as much as digits as its factorization.
1241121012041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85591350.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 1241121012041 its reverse (1402101211421), we get a palindrome (2643222223462).
The spelling of 1241121012041 in words is "one trillion, two hundred forty-one billion, one hundred twenty-one million, twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •