Base | Representation |
---|---|
bin | 111101011110100… |
… | …010010110110111 |
3 | 2122212210022200211 |
4 | 331132202112313 |
5 | 4103020241343 |
6 | 250202450251 |
7 | 34362612316 |
oct | 7536422667 |
9 | 2585708624 |
10 | 1031415223 |
11 | 48a230583 |
12 | 249503987 |
13 | 1358b9387 |
14 | 9ada827d |
15 | 6083979d |
hex | 3d7a25b7 |
1031415223 has 2 divisors, whose sum is σ = 1031415224. Its totient is φ = 1031415222.
The previous prime is 1031415199. The next prime is 1031415227. The reversal of 1031415223 is 3225141301.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1031415223 - 25 = 1031415191 is a prime.
It is a super-2 number, since 2×10314152232 = 2127634724472279458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031415194 and 1031415203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031415227) 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, 515707611 + 515707612.
It is an arithmetic number, because the mean of its divisors is an integer number (515707612).
Almost surely, 21031415223 is an apocalyptic number.
1031415223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031415223 is an equidigital number, since it uses as much as digits as its factorization.
1031415223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 1031415223 is about 32115.6538622523. The cubic root of 1031415223 is about 1010.3639582985.
Adding to 1031415223 its reverse (3225141301), we get a palindrome (4256556524).
The spelling of 1031415223 in words is "one billion, thirty-one million, four hundred fifteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •