Base | Representation |
---|---|
bin | 100111101010101… |
… | …1010010110011111 |
3 | 10102202112110121122 |
4 | 1033111122112133 |
5 | 10211214404043 |
6 | 340024121155 |
7 | 44661265304 |
oct | 11725322637 |
9 | 3382473548 |
10 | 1331013023 |
11 | 62335a86a |
12 | 3119061bb |
13 | 1829a6092 |
14 | c8ab50ab |
15 | 7bcb9368 |
hex | 4f55a59f |
1331013023 has 8 divisors (see below), whose sum is σ = 1406523120. Its totient is φ = 1256048640.
The previous prime is 1331013017. The next prime is 1331013077. The reversal of 1331013023 is 3203101331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1331013023 - 24 = 1331013007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1331012992 and 1331013010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1351013023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131408 + ... + 141173.
It is an arithmetic number, because the mean of its divisors is an integer number (175815390).
Almost surely, 21331013023 is an apocalyptic number.
1331013023 is a deficient number, since it is larger than the sum of its proper divisors (75510097).
1331013023 is a wasteful number, since it uses less digits than its factorization.
1331013023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272857.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1331013023 is about 36483.0511744837. The cubic root of 1331013023 is about 1100.0035875916.
Adding to 1331013023 its reverse (3203101331), we get a palindrome (4534114354).
The spelling of 1331013023 in words is "one billion, three hundred thirty-one million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •