Base | Representation |
---|---|
bin | 10010000100000100100… |
… | …000111110100011010001 |
3 | 11101200001211000202101101 |
4 | 102010010200332203101 |
5 | 130314211223132400 |
6 | 2350131035304401 |
7 | 155453045655634 |
oct | 22040440764321 |
9 | 4350054022341 |
10 | 1241321302225 |
11 | 439494572044 |
12 | 1806abbab101 |
13 | 900963232b4 |
14 | 4411a39dc1b |
15 | 224526be56a |
hex | 1210483e8d1 |
1241321302225 has 12 divisors (see below), whose sum is σ = 1541261090700. Its totient is φ = 991752089600.
The previous prime is 1241321302183. The next prime is 1241321302231. The reversal of 1241321302225 is 5222031231421.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 637287679809 + 604033622416 = 798303^2 + 777196^2 .
It is a de Polignac number, because none of the positive numbers 2k-1241321302225 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1241321302193 and 1241321302202.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32604400 + ... + 32642449.
It is an arithmetic number, because the mean of its divisors is an integer number (128438424225).
Almost surely, 21241321302225 is an apocalyptic number.
It is an amenable number.
1241321302225 is a deficient number, since it is larger than the sum of its proper divisors (299939788475).
1241321302225 is an equidigital number, since it uses as much as digits as its factorization.
1241321302225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65247620 (or 65247615 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 1241321302225 its reverse (5222031231421), we get a palindrome (6463352533646).
The spelling of 1241321302225 in words is "one trillion, two hundred forty-one billion, three hundred twenty-one million, three hundred two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •