Base | Representation |
---|---|
bin | 111110000100101… |
… | …101100000010001 |
3 | 2200120121201220021 |
4 | 332010231200101 |
5 | 4113101003403 |
6 | 251201143441 |
7 | 34543641526 |
oct | 7604554021 |
9 | 2616551807 |
10 | 1041422353 |
11 | 494946034 |
12 | 25092ab81 |
13 | 1379b125a |
14 | 9c45114d |
15 | 616648bd |
hex | 3e12d811 |
1041422353 has 2 divisors, whose sum is σ = 1041422354. Its totient is φ = 1041422352.
The previous prime is 1041422323. The next prime is 1041422383. The reversal of 1041422353 is 3532241401.
It is a balanced prime because it is at equal distance from previous prime (1041422323) and next prime (1041422383).
It can be written as a sum of positive squares in only one way, i.e., 803892609 + 237529744 = 28353^2 + 15412^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041422353 - 213 = 1041414161 is a prime.
It is not a weakly prime, because it can be changed into another prime (1041422303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520711176 + 520711177.
It is an arithmetic number, because the mean of its divisors is an integer number (520711177).
Almost surely, 21041422353 is an apocalyptic number.
It is an amenable number.
1041422353 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041422353 is an equidigital number, since it uses as much as digits as its factorization.
1041422353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 1041422353 is about 32271.0761053920. The cubic root of 1041422353 is about 1013.6210749284.
Adding to 1041422353 its reverse (3532241401), we get a palindrome (4573663754).
The spelling of 1041422353 in words is "one billion, forty-one million, four hundred twenty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •