Base | Representation |
---|---|
bin | 111100001101101… |
… | …110010000101001 |
3 | 2121101221000110112 |
4 | 330031232100221 |
5 | 4032104332223 |
6 | 244124424105 |
7 | 34014546611 |
oct | 7415562051 |
9 | 2541830415 |
10 | 1010230313 |
11 | 479280a94 |
12 | 2423a8035 |
13 | 1313ac821 |
14 | 98251a41 |
15 | 5da52778 |
hex | 3c36e429 |
1010230313 has 2 divisors, whose sum is σ = 1010230314. Its totient is φ = 1010230312.
The previous prime is 1010230301. The next prime is 1010230373. The reversal of 1010230313 is 3130320101.
1010230313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 991809049 + 18421264 = 31493^2 + 4292^2 .
It is an emirp because it is prime and its reverse (3130320101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010230313 - 210 = 1010229289 is a prime.
It is not a weakly prime, because it can be changed into another prime (1010230373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505115156 + 505115157.
It is an arithmetic number, because the mean of its divisors is an integer number (505115157).
Almost surely, 21010230313 is an apocalyptic number.
It is an amenable number.
1010230313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010230313 is an equidigital number, since it uses as much as digits as its factorization.
1010230313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 1010230313 is about 31784.1204534591. The cubic root of 1010230313 is about 1003.3985411668.
Adding to 1010230313 its reverse (3130320101), we get a palindrome (4140550414).
The spelling of 1010230313 in words is "one billion, ten million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •