Base | Representation |
---|---|
bin | 10011101010110100001… |
… | …101011100111010011101 |
3 | 11210012211100001121022021 |
4 | 103222310031130322131 |
5 | 134121131121444000 |
6 | 2512534123420141 |
7 | 166436656155643 |
oct | 23526415347235 |
9 | 4705740047267 |
10 | 1351643156125 |
11 | 481257362809 |
12 | 199b5a684651 |
13 | 9a5c84001a2 |
14 | 495c4205193 |
15 | 2525cb9111a |
hex | 13ab435ce9d |
1351643156125 has 16 divisors (see below), whose sum is σ = 1687190909040. Its totient is φ = 1081096416000.
The previous prime is 1351643156111. The next prime is 1351643156131. The reversal of 1351643156125 is 5216513461531.
It can be written as a sum of positive squares in 8 ways, for example, as 329354323236 + 1022288832889 = 573894^2 + 1011083^2 .
It is not a de Polignac number, because 1351643156125 - 233 = 1343053221533 is a prime.
It is a super-2 number, since 2×13516431561252 (a number of 25 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 466936 + ... + 1709185.
It is an arithmetic number, because the mean of its divisors is an integer number (105449431815).
Almost surely, 21351643156125 is an apocalyptic number.
It is an amenable number.
1351643156125 is a deficient number, since it is larger than the sum of its proper divisors (335547752915).
1351643156125 is an equidigital number, since it uses as much as digits as its factorization.
1351643156125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2181105 (or 2181095 counting only the distinct ones).
The product of its digits is 324000, while the sum is 43.
The spelling of 1351643156125 in words is "one trillion, three hundred fifty-one billion, six hundred forty-three million, one hundred fifty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •