Base | Representation |
---|---|
bin | 111110000000010… |
… | …000000100011101 |
3 | 2200111102100010210 |
4 | 332000100010131 |
5 | 4112301100323 |
6 | 251120123033 |
7 | 34531002126 |
oct | 7600200435 |
9 | 2614370123 |
10 | 1040253213 |
11 | 4942176aa |
12 | 250466479 |
13 | 13769205c |
14 | 9c22904d |
15 | 614d3293 |
hex | 3e01011d |
1040253213 has 8 divisors (see below), whose sum is σ = 1387238400. Its totient is φ = 693385088.
The previous prime is 1040253169. The next prime is 1040253217. The reversal of 1040253213 is 3123520401.
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 1040253213 - 220 = 1039204637 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1040253213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040253217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5853 + ... + 45986.
It is an arithmetic number, because the mean of its divisors is an integer number (173404800).
Almost surely, 21040253213 is an apocalyptic number.
It is an amenable number.
1040253213 is a deficient number, since it is larger than the sum of its proper divisors (346985187).
1040253213 is an equidigital number, since it uses as much as digits as its factorization.
1040253213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58531.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1040253213 is about 32252.9566551657. The cubic root of 1040253213 is about 1013.2416231517.
Adding to 1040253213 its reverse (3123520401), we get a palindrome (4163773614).
The spelling of 1040253213 in words is "one billion, forty million, two hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •