Base | Representation |
---|---|
bin | 100111001000110… |
… | …0100110111110011 |
3 | 10101112002000100010 |
4 | 1032101210313303 |
5 | 10142141332243 |
6 | 334151030003 |
7 | 44354162556 |
oct | 11621446763 |
9 | 3345060303 |
10 | 1313230323 |
11 | 614314419 |
12 | 30796b303 |
13 | 17c0bac82 |
14 | c65a669d |
15 | 7a455433 |
hex | 4e464df3 |
1313230323 has 4 divisors (see below), whose sum is σ = 1750973768. Its totient is φ = 875486880.
The previous prime is 1313230309. The next prime is 1313230393. The reversal of 1313230323 is 3230323131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1313230323 - 29 = 1313229811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1313230323.
It is not an unprimeable number, because it can be changed into a prime (1313230393) 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 3 ways as a sum of consecutive naturals, for example, 218871718 + ... + 218871723.
It is an arithmetic number, because the mean of its divisors is an integer number (437743442).
Almost surely, 21313230323 is an apocalyptic number.
1313230323 is a deficient number, since it is larger than the sum of its proper divisors (437743445).
1313230323 is an equidigital number, since it uses as much as digits as its factorization.
1313230323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437743444.
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 1313230323 is about 36238.5198787147. The cubic root of 1313230323 is about 1095.0828243683.
Adding to 1313230323 its reverse (3230323131), we get a palindrome (4543553454).
The spelling of 1313230323 in words is "one billion, three hundred thirteen million, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •