Base | Representation |
---|---|
bin | 100111000101001… |
… | …0011010001010111 |
3 | 10101101111010021210 |
4 | 1032022103101113 |
5 | 10141144320343 |
6 | 334042112503 |
7 | 44332030530 |
oct | 11612232127 |
9 | 3341433253 |
10 | 1311323223 |
11 | 613231601 |
12 | 3071ab733 |
13 | 17b8a0c02 |
14 | c622b687 |
15 | 7a1ca333 |
hex | 4e293457 |
1311323223 has 16 divisors (see below), whose sum is σ = 2011622400. Its totient is φ = 744296736.
The previous prime is 1311323207. The next prime is 1311323239. The reversal of 1311323223 is 3223231131.
It is an interprime number because it is at equal distance from previous prime (1311323207) and next prime (1311323239).
It is not a de Polignac number, because 1311323223 - 24 = 1311323207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1311323223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311327223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 206415 + ... + 212672.
It is an arithmetic number, because the mean of its divisors is an integer number (125726400).
Almost surely, 21311323223 is an apocalyptic number.
1311323223 is a deficient number, since it is larger than the sum of its proper divisors (700299177).
1311323223 is a wasteful number, since it uses less digits than its factorization.
1311323223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419246.
The product of its digits is 648, while the sum is 21.
The square root of 1311323223 is about 36212.1971578638. The cubic root of 1311323223 is about 1094.5524669769.
Adding to 1311323223 its reverse (3223231131), we get a palindrome (4534554354).
The spelling of 1311323223 in words is "one billion, three hundred eleven million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •