Base | Representation |
---|---|
bin | 100111000011011… |
… | …0010101011111001 |
3 | 10101022202101102100 |
4 | 1032012302223321 |
5 | 10140430401241 |
6 | 334010254013 |
7 | 44321146563 |
oct | 11606625371 |
9 | 3338671370 |
10 | 1310403321 |
11 | 612763457 |
12 | 306a27309 |
13 | 17b63b2a6 |
14 | c606c333 |
15 | 7a0979b6 |
hex | 4e1b2af9 |
1310403321 has 6 divisors (see below), whose sum is σ = 1892804810. Its totient is φ = 873602208.
The previous prime is 1310403319. The next prime is 1310403329. The reversal of 1310403321 is 1233040131.
It can be written as a sum of positive squares in only one way, i.e., 902161296 + 408242025 = 30036^2 + 20205^2 .
It is not a de Polignac number, because 1310403321 - 21 = 1310403319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310403294 and 1310403303.
It is not an unprimeable number, because it can be changed into a prime (1310403329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 72800176 + ... + 72800193.
Almost surely, 21310403321 is an apocalyptic number.
It is an amenable number.
1310403321 is a deficient number, since it is larger than the sum of its proper divisors (582401489).
1310403321 is a wasteful number, since it uses less digits than its factorization.
1310403321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145600375 (or 145600372 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1310403321 is about 36199.4933804328. The cubic root of 1310403321 is about 1094.2964618155.
Adding to 1310403321 its reverse (1233040131), we get a palindrome (2543443452).
The spelling of 1310403321 in words is "one billion, three hundred ten million, four hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •