Base | Representation |
---|---|
bin | 10011101001100101011… |
… | …101110010111011010011 |
3 | 11210002102021010222102002 |
4 | 103221211131302323103 |
5 | 134110424420244111 |
6 | 2512155051344215 |
7 | 166362144651662 |
oct | 23514535627323 |
9 | 4702367128362 |
10 | 1350322040531 |
11 | 480739653042 |
12 | 19985015206b |
13 | 9a4477b1099 |
14 | 494da988dd9 |
15 | 251d1bce63b |
hex | 13a65772ed3 |
1350322040531 has 8 divisors (see below), whose sum is σ = 1397027288064. Its totient is φ = 1303813447560.
The previous prime is 1350322040521. The next prime is 1350322040533. The reversal of 1350322040531 is 1350402230531.
It is a happy number.
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-1350322040531 is a prime.
It is a super-3 number, since 3×13503220405313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1350322040494 and 1350322040503.
It is not an unprimeable number, because it can be changed into a prime (1350322040533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49149671 + ... + 49177136.
It is an arithmetic number, because the mean of its divisors is an integer number (174628411008).
Almost surely, 21350322040531 is an apocalyptic number.
1350322040531 is a deficient number, since it is larger than the sum of its proper divisors (46705247533).
1350322040531 is an equidigital number, since it uses as much as digits as its factorization.
1350322040531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98327281.
The product of its (nonzero) digits is 10800, while the sum is 29.
The spelling of 1350322040531 in words is "one trillion, three hundred fifty billion, three hundred twenty-two million, forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •