Base | Representation |
---|---|
bin | 10011000101000110101… |
… | …010010110001011111011 |
3 | 11122100022100001010121202 |
4 | 103011012222112023323 |
5 | 132440214014000243 |
6 | 2442200110124415 |
7 | 163504350426143 |
oct | 23050652261373 |
9 | 4570270033552 |
10 | 1311150531323 |
11 | 466068325436 |
12 | 1921397b070b |
13 | 96844278779 |
14 | 47662441923 |
15 | 2418cceb4b8 |
hex | 13146a962fb |
1311150531323 has 4 divisors (see below), whose sum is σ = 1356362618640. Its totient is φ = 1265938444008.
The previous prime is 1311150531287. The next prime is 1311150531349. The reversal of 1311150531323 is 3231350511131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1311150531323 - 212 = 1311150527227 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 45212087287 = 1311150531323 / (1 + 3 + 1 + 1 + 1 + 5 + 0 + 5 + 3 + 1 + 3 + 2 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311150530323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22606043615 + ... + 22606043672.
It is an arithmetic number, because the mean of its divisors is an integer number (339090654660).
Almost surely, 21311150531323 is an apocalyptic number.
1311150531323 is a deficient number, since it is larger than the sum of its proper divisors (45212087317).
1311150531323 is an equidigital number, since it uses as much as digits as its factorization.
1311150531323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45212087316.
The product of its (nonzero) digits is 4050, while the sum is 29.
The spelling of 1311150531323 in words is "one trillion, three hundred eleven billion, one hundred fifty million, five hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •