Base | Representation |
---|---|
bin | 111110001000001… |
… | …000111100111101 |
3 | 2200122022101220101 |
4 | 332020020330331 |
5 | 4113313234323 |
6 | 251232321101 |
7 | 34554404233 |
oct | 7610107475 |
9 | 2618271811 |
10 | 1042321213 |
11 | 4953aa39a |
12 | 2510a3191 |
13 | 137c3741b |
14 | 9c606953 |
15 | 61790dad |
hex | 3e208f3d |
1042321213 has 8 divisors (see below), whose sum is σ = 1059932160. Its totient is φ = 1024727280.
The previous prime is 1042321207. The next prime is 1042321223. The reversal of 1042321213 is 3121232401.
It is a happy number.
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 1042321213 - 213 = 1042313021 is a prime.
It is a super-2 number, since 2×10423212132 = 2172867022139582738, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042321223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202356 + ... + 207442.
It is an arithmetic number, because the mean of its divisors is an integer number (132491520).
Almost surely, 21042321213 is an apocalyptic number.
It is an amenable number.
1042321213 is a deficient number, since it is larger than the sum of its proper divisors (17610947).
1042321213 is an equidigital number, since it uses as much as digits as its factorization.
1042321213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8507.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1042321213 is about 32284.9998141552. Note that the first 3 decimals coincide. The cubic root of 1042321213 is about 1013.9126125662.
Adding to 1042321213 its reverse (3121232401), we get a palindrome (4163553614).
The spelling of 1042321213 in words is "one billion, forty-two million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •