Base | Representation |
---|---|
bin | 10011001110011111000… |
… | …111000111110010011101 |
3 | 11200022022101210220011211 |
4 | 103032133013013302131 |
5 | 133121331421413000 |
6 | 2450543452144421 |
7 | 164312113064533 |
oct | 23163707076235 |
9 | 4608271726154 |
10 | 1321224404125 |
11 | 46a36780614a |
12 | 19408b468111 |
13 | 9778b35c452 |
14 | 47d3a314153 |
15 | 2457c3ec7ba |
hex | 1339f1c7c9d |
1321224404125 has 16 divisors (see below), whose sum is σ = 1649427210288. Its totient is φ = 1056633912000.
The previous prime is 1321224404111. The next prime is 1321224404189. The reversal of 1321224404125 is 5214044221231.
It can be written as a sum of positive squares in 8 ways, for example, as 413926243641 + 907298160484 = 643371^2 + 952522^2 .
It is not a de Polignac number, because 1321224404125 - 221 = 1321222306973 is a prime.
It is a super-2 number, since 2×13212244041252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1343902 + ... + 2109151.
It is an arithmetic number, because the mean of its divisors is an integer number (103089200643).
Almost surely, 21321224404125 is an apocalyptic number.
It is an amenable number.
1321224404125 is a deficient number, since it is larger than the sum of its proper divisors (328202806163).
1321224404125 is an equidigital number, since it uses as much as digits as its factorization.
1321224404125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3456129 (or 3456119 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 1321224404125 its reverse (5214044221231), we get a palindrome (6535268625356).
The spelling of 1321224404125 in words is "one trillion, three hundred twenty-one billion, two hundred twenty-four million, four hundred four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •