Base | Representation |
---|---|
bin | 10011101010100011001… |
… | …000000100001101001011 |
3 | 11210012002100201120021120 |
4 | 103222203020010031023 |
5 | 134120034233002111 |
6 | 2512445444210323 |
7 | 166426605664506 |
oct | 23524310041513 |
9 | 4705070646246 |
10 | 1351356531531 |
11 | 48111a594486 |
12 | 199a9a6999a3 |
13 | 9a580c06436 |
14 | 4959811413d |
15 | 25242925406 |
hex | 13aa320434b |
1351356531531 has 16 divisors (see below), whose sum is σ = 1809741312000. Its totient is φ = 896939693888.
The previous prime is 1351356531493. The next prime is 1351356531533.
It is a happy number.
1351356531531 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 1351356531531 - 26 = 1351356531467 is a prime.
It is a super-2 number, since 2×13513565315312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1351356531533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3130630 + ... + 3536036.
It is an arithmetic number, because the mean of its divisors is an integer number (113108832000).
Almost surely, 21351356531531 is an apocalyptic number.
1351356531531 is a deficient number, since it is larger than the sum of its proper divisors (458384780469).
1351356531531 is a wasteful number, since it uses less digits than its factorization.
1351356531531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410298.
The product of its digits is 303750, while the sum is 42.
It can be divided in two parts, 135135 and 6531531, that added together give a palindrome (6666666).
The spelling of 1351356531531 in words is "one trillion, three hundred fifty-one billion, three hundred fifty-six million, five hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •