Base | Representation |
---|---|
bin | 10011101110001110001… |
… | …111000111000111011101 |
3 | 11210120021020222120000102 |
4 | 103232032033013013131 |
5 | 134201124030233341 |
6 | 2514341112310445 |
7 | 166626423425264 |
oct | 23561617070735 |
9 | 4716236876012 |
10 | 1355301024221 |
11 | 4828641061a1 |
12 | 19a7bb6a2425 |
13 | 9aa5c191a91 |
14 | 4984dd395db |
15 | 253c3d83c9b |
hex | 13b8e3c71dd |
1355301024221 has 4 divisors (see below), whose sum is σ = 1355306624700. Its totient is φ = 1355295423744.
The previous prime is 1355301024151. The next prime is 1355301024227. The reversal of 1355301024221 is 1224201035531.
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 653494392100 + 701806632121 = 808390^2 + 837739^2 .
It is a cyclic number.
It is not a de Polignac number, because 1355301024221 - 218 = 1355300762077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1355301024227) 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, 2420036 + ... + 2926973.
It is an arithmetic number, because the mean of its divisors is an integer number (338826656175).
Almost surely, 21355301024221 is an apocalyptic number.
It is an amenable number.
1355301024221 is a deficient number, since it is larger than the sum of its proper divisors (5600479).
1355301024221 is an equidigital number, since it uses as much as digits as its factorization.
1355301024221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5600478.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 1355301024221 its reverse (1224201035531), we get a palindrome (2579502059752).
The spelling of 1355301024221 in words is "one trillion, three hundred fifty-five billion, three hundred one million, twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •