Base | Representation |
---|---|
bin | 111110000001101… |
… | …001111100110011 |
3 | 2200112010001010222 |
4 | 332001221330303 |
5 | 4112344340423 |
6 | 251132043255 |
7 | 34534064345 |
oct | 7601517463 |
9 | 2615101128 |
10 | 1040621363 |
11 | 494449261 |
12 | 25060352b |
13 | 1377907b2 |
14 | 9c2c3295 |
15 | 615573c8 |
hex | 3e069f33 |
1040621363 has 8 divisors (see below), whose sum is σ = 1049599488. Its totient is φ = 1031655744.
The previous prime is 1040621359. The next prime is 1040621383. The reversal of 1040621363 is 3631260401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1040621363 - 22 = 1040621359 is a prime.
It is a super-2 number, since 2×10406213632 = 2165785642263955538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040621303) 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 7 ways as a sum of consecutive naturals, for example, 248495 + ... + 252647.
It is an arithmetic number, because the mean of its divisors is an integer number (131199936).
Almost surely, 21040621363 is an apocalyptic number.
1040621363 is a deficient number, since it is larger than the sum of its proper divisors (8978125).
1040621363 is a wasteful number, since it uses less digits than its factorization.
1040621363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6253.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 1040621363 is about 32258.6633790056. The cubic root of 1040621363 is about 1013.3611392152.
Adding to 1040621363 its reverse (3631260401), we get a palindrome (4671881764).
The spelling of 1040621363 in words is "one billion, forty million, six hundred twenty-one thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •