Base | Representation |
---|---|
bin | 111100001101101… |
… | …110001111001111 |
3 | 2121101221000100012 |
4 | 330031232033033 |
5 | 4032104331343 |
6 | 244124423435 |
7 | 34014546422 |
oct | 7415561717 |
9 | 2541830305 |
10 | 1010230223 |
11 | 479280a12 |
12 | 2423a7b7b |
13 | 1313ac782 |
14 | 982519b9 |
15 | 5da52718 |
hex | 3c36e3cf |
1010230223 has 2 divisors, whose sum is σ = 1010230224. Its totient is φ = 1010230222.
The previous prime is 1010230217. The next prime is 1010230229. The reversal of 1010230223 is 3220320101.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1010230217) and next prime (1010230229).
It is a cyclic number.
It is not a de Polignac number, because 1010230223 - 214 = 1010213839 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010230198 and 1010230207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010230229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505115111 + 505115112.
It is an arithmetic number, because the mean of its divisors is an integer number (505115112).
Almost surely, 21010230223 is an apocalyptic number.
1010230223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010230223 is an equidigital number, since it uses as much as digits as its factorization.
1010230223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1010230223 is about 31784.1190376578. The cubic root of 1010230223 is about 1003.3985113697.
Adding to 1010230223 its reverse (3220320101), we get a palindrome (4230550324).
The spelling of 1010230223 in words is "one billion, ten million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •