Base | Representation |
---|---|
bin | 111110000000000… |
… | …110000101100001 |
3 | 2200111100021001021 |
4 | 332000012011201 |
5 | 4112243243241 |
6 | 251115205441 |
7 | 34530441661 |
oct | 7600060541 |
9 | 2614307037 |
10 | 1040212321 |
11 | 494199a05 |
12 | 250446881 |
13 | 137679565 |
14 | 9c2181a1 |
15 | 614c60d1 |
hex | 3e006161 |
1040212321 has 8 divisors (see below), whose sum is σ = 1057932288. Its totient is φ = 1022514000.
The previous prime is 1040212307. The next prime is 1040212343. The reversal of 1040212321 is 1232120401.
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 1040212321 - 25 = 1040212289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1040212295 and 1040212304.
It is not an unprimeable number, because it can be changed into a prime (1040212301) 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, 113376 + ... + 122206.
It is an arithmetic number, because the mean of its divisors is an integer number (132241536).
Almost surely, 21040212321 is an apocalyptic number.
It is an amenable number.
1040212321 is a deficient number, since it is larger than the sum of its proper divisors (17719967).
1040212321 is an equidigital number, since it uses as much as digits as its factorization.
1040212321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10823.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1040212321 is about 32252.3227225575. The cubic root of 1040212321 is about 1013.2283462498.
Adding to 1040212321 its reverse (1232120401), we get a palindrome (2272332722).
The spelling of 1040212321 in words is "one billion, forty million, two hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •