Base | Representation |
---|---|
bin | 11101011001101101111… |
… | …11110001010011011001 |
3 | 10120120121100210101102021 |
4 | 32230312333301103121 |
5 | 113022432420014431 |
6 | 2052033045134441 |
7 | 132662455220032 |
oct | 16546677612331 |
9 | 3516540711367 |
10 | 1010240001241 |
11 | 35a493164439 |
12 | 14395b3ba421 |
13 | 7435a907583 |
14 | 36c78401a89 |
15 | 1b42a730b11 |
hex | eb36ff14d9 |
1010240001241 has 4 divisors (see below), whose sum is σ = 1012431411684. Its totient is φ = 1008048590800.
The previous prime is 1010240001179. The next prime is 1010240001263. The reversal of 1010240001241 is 1421000420101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 569981210841 + 440258790400 = 754971^2 + 663520^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010240001241 - 233 = 1001650066649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010240001041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1095704530 + ... + 1095705451.
It is an arithmetic number, because the mean of its divisors is an integer number (253107852921).
Almost surely, 21010240001241 is an apocalyptic number.
It is an amenable number.
1010240001241 is a deficient number, since it is larger than the sum of its proper divisors (2191410443).
1010240001241 is an equidigital number, since it uses as much as digits as its factorization.
1010240001241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2191410442.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1010240001241 its reverse (1421000420101), we get a palindrome (2431240421342).
The spelling of 1010240001241 in words is "one trillion, ten billion, two hundred forty million, one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •