Base | Representation |
---|---|
bin | 11110101101011111010… |
… | …10101111010101010001 |
3 | 10201212200200200121122111 |
4 | 33112233222233111101 |
5 | 114242034314013431 |
6 | 2124431514305321 |
7 | 136144122513301 |
oct | 17265752572521 |
9 | 3655620617574 |
10 | 1055214204241 |
11 | 3775719aa84a |
12 | 150611128241 |
13 | 78677385802 |
14 | 39103477601 |
15 | 1c6adc757b1 |
hex | f5afaaf551 |
1055214204241 has 4 divisors (see below), whose sum is σ = 1055240146800. Its totient is φ = 1055188261684.
The previous prime is 1055214204223. The next prime is 1055214204307. The reversal of 1055214204241 is 1424024125501.
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 1055214204241 - 27 = 1055214204113 is a prime.
It is a super-2 number, since 2×10552142042412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055214204041) 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, 12910171 + ... + 12991648.
It is an arithmetic number, because the mean of its divisors is an integer number (263810036700).
Almost surely, 21055214204241 is an apocalyptic number.
It is an amenable number.
1055214204241 is a deficient number, since it is larger than the sum of its proper divisors (25942559).
1055214204241 is an equidigital number, since it uses as much as digits as its factorization.
1055214204241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25942558.
The product of its (nonzero) digits is 12800, while the sum is 31.
Adding to 1055214204241 its reverse (1424024125501), we get a palindrome (2479238329742).
The spelling of 1055214204241 in words is "one trillion, fifty-five billion, two hundred fourteen million, two hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •