Base | Representation |
---|---|
bin | 111101100010011… |
… | …111000010100101 |
3 | 2122221201220102210 |
4 | 331202133002211 |
5 | 4103301401323 |
6 | 250240554033 |
7 | 34404452634 |
oct | 7542370245 |
9 | 2587656383 |
10 | 1032450213 |
11 | 48a878143 |
12 | 249922919 |
13 | 135b8c4b2 |
14 | 9b19751b |
15 | 60991293 |
hex | 3d89f0a5 |
1032450213 has 4 divisors (see below), whose sum is σ = 1376600288. Its totient is φ = 688300140.
The previous prime is 1032450173. The next prime is 1032450217. The reversal of 1032450213 is 3120542301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1032450213 - 212 = 1032446117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1032450213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032450217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172075033 + ... + 172075038.
It is an arithmetic number, because the mean of its divisors is an integer number (344150072).
Almost surely, 21032450213 is an apocalyptic number.
It is an amenable number.
1032450213 is a deficient number, since it is larger than the sum of its proper divisors (344150075).
1032450213 is an equidigital number, since it uses as much as digits as its factorization.
1032450213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344150074.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1032450213 is about 32131.7633036222. The cubic root of 1032450213 is about 1010.7018005772.
Adding to 1032450213 its reverse (3120542301), we get a palindrome (4152992514).
The spelling of 1032450213 in words is "one billion, thirty-two million, four hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •