Base | Representation |
---|---|
bin | 10011101011100100010… |
… | …101011000101111000011 |
3 | 11210021220121022002020111 |
4 | 103223210111120233003 |
5 | 134124304314330111 |
6 | 2513150204452151 |
7 | 166465661635114 |
oct | 23534425305703 |
9 | 4707817262214 |
10 | 1352450542531 |
11 | 481631089100 |
12 | 19a144b4a057 |
13 | 9a6c676b11a |
14 | 4965d53420b |
15 | 252a89c6a21 |
hex | 13ae4558bc3 |
1352450542531 has 48 divisors (see below), whose sum is σ = 1526145697440. Its totient is φ = 1197237888000.
The previous prime is 1352450542511. The next prime is 1352450542589.
1352450542531 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1352450542531 - 213 = 1352450534339 is a prime.
It is a super-2 number, since 2×13524505425312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1352450542501) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 826175445 + ... + 826177081.
It is an arithmetic number, because the mean of its divisors is an integer number (31794702030).
Almost surely, 21352450542531 is an apocalyptic number.
1352450542531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1352450542531 is a deficient number, since it is larger than the sum of its proper divisors (173695154909).
1352450542531 is a wasteful number, since it uses less digits than its factorization.
1352450542531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2836 (or 2825 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 40.
It can be divided in two parts, 1352450 and 542531, that added together give a palindrome (1894981).
The spelling of 1352450542531 in words is "one trillion, three hundred fifty-two billion, four hundred fifty million, five hundred forty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •