Base | Representation |
---|---|
bin | 10011101010011010011… |
… | …001101010110110011101 |
3 | 11210011201011021200101110 |
4 | 103222122121222312131 |
5 | 134114234244320300 |
6 | 2512423134532233 |
7 | 166423150532166 |
oct | 23523231526635 |
9 | 4704634250343 |
10 | 1351210151325 |
11 | 4810549a4901 |
12 | 199a59667079 |
13 | 9a5597a4028 |
14 | 495828cc76d |
15 | 25234b5d550 |
hex | 13a9a66ad9d |
1351210151325 has 12 divisors (see below), whose sum is σ = 2234000783648. Its totient is φ = 720645414000.
The previous prime is 1351210151311. The next prime is 1351210151351. The reversal of 1351210151325 is 5231510121531.
It is not a de Polignac number, because 1351210151325 - 25 = 1351210151293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1351210151292 and 1351210151301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9008067601 + ... + 9008067750.
Almost surely, 21351210151325 is an apocalyptic number.
1351210151325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1351210151325 is a deficient number, since it is larger than the sum of its proper divisors (882790632323).
1351210151325 is a wasteful number, since it uses less digits than its factorization.
1351210151325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18016135364 (or 18016135359 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 1351210151325 its reverse (5231510121531), we get a palindrome (6582720272856).
The spelling of 1351210151325 in words is "one trillion, three hundred fifty-one billion, two hundred ten million, one hundred fifty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •