Base | Representation |
---|---|
bin | 10011001110110001011… |
… | …100100011001000010001 |
3 | 11200100002211121221111222 |
4 | 103032301130203020101 |
5 | 133122444143323100 |
6 | 2451034201214425 |
7 | 164322536515622 |
oct | 23166134431021 |
9 | 4610084557458 |
10 | 1321532011025 |
11 | 46a505405826 |
12 | 194156491415 |
13 | 97809cc1775 |
14 | 47d69107a49 |
15 | 24599410485 |
hex | 133b1723211 |
1321532011025 has 12 divisors (see below), whose sum is σ = 1640151189900. Its totient is φ = 1056289159680.
The previous prime is 1321532011021. The next prime is 1321532011031. The reversal of 1321532011025 is 5201102351231.
It can be written as a sum of positive squares in 6 ways, for example, as 239208049921 + 1082323961104 = 489089^2 + 1040348^2 .
It is not a de Polignac number, because 1321532011025 - 22 = 1321532011021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1321532010985 and 1321532011003.
It is not an unprimeable number, because it can be changed into a prime (1321532011021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23382440 + ... + 23438889.
It is an arithmetic number, because the mean of its divisors is an integer number (136679265825).
Almost surely, 21321532011025 is an apocalyptic number.
It is an amenable number.
1321532011025 is a deficient number, since it is larger than the sum of its proper divisors (318619178875).
1321532011025 is a wasteful number, since it uses less digits than its factorization.
1321532011025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46822468 (or 46822463 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 1321532011025 its reverse (5201102351231), we get a palindrome (6522634362256).
The spelling of 1321532011025 in words is "one trillion, three hundred twenty-one billion, five hundred thirty-two million, eleven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •