Base | Representation |
---|---|
bin | 10011010010011000000… |
… | …000001101111100101111 |
3 | 11200201002102011022001101 |
4 | 103102120000031330233 |
5 | 133203404412334020 |
6 | 2452514100223531 |
7 | 164520436100566 |
oct | 23223000157457 |
9 | 4621072138041 |
10 | 1325400121135 |
11 | 47110a8a7142 |
12 | 194a5599aba7 |
13 | 97ca54b540c |
14 | 48214b28bdd |
15 | 24723cd200a |
hex | 1349800df2f |
1325400121135 has 4 divisors (see below), whose sum is σ = 1590480145368. Its totient is φ = 1060320096904.
The previous prime is 1325400120953. The next prime is 1325400121141. The reversal of 1325400121135 is 5311210045231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1325400121135 - 217 = 1325399990063 is a prime.
It is a super-2 number, since 2×13254001211352 (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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 132540012109 + ... + 132540012118.
It is an arithmetic number, because the mean of its divisors is an integer number (397620036342).
Almost surely, 21325400121135 is an apocalyptic number.
1325400121135 is a deficient number, since it is larger than the sum of its proper divisors (265080024233).
1325400121135 is an equidigital number, since it uses as much as digits as its factorization.
1325400121135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265080024232.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 1325400121135 its reverse (5311210045231), we get a palindrome (6636610166366).
The spelling of 1325400121135 in words is "one trillion, three hundred twenty-five billion, four hundred million, one hundred twenty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •