Base | Representation |
---|---|
bin | 10110010001111001110… |
… | …011111100010000111101 |
3 | 12102100220122111000201012 |
4 | 112101321303330100331 |
5 | 200041043304013301 |
6 | 3131204450125005 |
7 | 215420616262334 |
oct | 26217163742075 |
9 | 5370818430635 |
10 | 1531052016701 |
11 | 540351a49109 |
12 | 20888a280765 |
13 | b14ba72bb9c |
14 | 541636c2d1b |
15 | 29c5d52bebb |
hex | 16479cfc43d |
1531052016701 has 8 divisors (see below), whose sum is σ = 1606446127104. Its totient is φ = 1456393458960.
The previous prime is 1531052016671. The next prime is 1531052016731. The reversal of 1531052016701 is 1076102501351.
It is an interprime number because it is at equal distance from previous prime (1531052016671) and next prime (1531052016731).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1531052016701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1531052016731) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 183883901 + ... + 183892226.
It is an arithmetic number, because the mean of its divisors is an integer number (200805765888).
Almost surely, 21531052016701 is an apocalyptic number.
It is an amenable number.
1531052016701 is a deficient number, since it is larger than the sum of its proper divisors (75394110403).
1531052016701 is a wasteful number, since it uses less digits than its factorization.
1531052016701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367776331.
The product of its (nonzero) digits is 6300, while the sum is 32.
The spelling of 1531052016701 in words is "one trillion, five hundred thirty-one billion, fifty-two million, sixteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •