Base | Representation |
---|---|
bin | 100111001000101… |
… | …1110001110110011 |
3 | 10101112000122000201 |
4 | 1032101132032303 |
5 | 10142134444443 |
6 | 334150300031 |
7 | 44354020351 |
oct | 11621361663 |
9 | 3345018021 |
10 | 1313203123 |
11 | 6142a5a41 |
12 | 307957617 |
13 | 17c0ab78b |
14 | c659a7d1 |
15 | 7a44c34d |
hex | 4e45e3b3 |
1313203123 has 4 divisors (see below), whose sum is σ = 1313353728. Its totient is φ = 1313052520.
The previous prime is 1313203117. The next prime is 1313203163. The reversal of 1313203123 is 3213023131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1313203123 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 1313203123.
It is not an unprimeable number, because it can be changed into a prime (1313203163) 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, 61363 + ... + 79948.
It is an arithmetic number, because the mean of its divisors is an integer number (328338432).
Almost surely, 21313203123 is an apocalyptic number.
1313203123 is a deficient number, since it is larger than the sum of its proper divisors (150605).
1313203123 is an equidigital number, since it uses as much as digits as its factorization.
1313203123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150604.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 1313203123 is about 36238.1445855055. The cubic root of 1313203123 is about 1095.0752637605.
Adding to 1313203123 its reverse (3213023131), we get a palindrome (4526226254).
The spelling of 1313203123 in words is "one billion, three hundred thirteen million, two hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •