Base | Representation |
---|---|
bin | 111110010010100… |
… | …001000000111101 |
3 | 2200211102121001010 |
4 | 332102201000331 |
5 | 4120012304323 |
6 | 251410505433 |
7 | 34616463246 |
oct | 7622410075 |
9 | 2624377033 |
10 | 1045041213 |
11 | 496997a27 |
12 | 251b95279 |
13 | 13867a4a8 |
14 | 9cb13ccd |
15 | 61b2bc93 |
hex | 3e4a103d |
1045041213 has 8 divisors (see below), whose sum is σ = 1393698400. Its totient is φ = 696539088.
The previous prime is 1045041199. The next prime is 1045041223. The reversal of 1045041213 is 3121405401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1045041213 - 24 = 1045041197 is a prime.
It is a super-2 number, since 2×10450412132 = 2184222273737022738, which contains 22 as substring.
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 1045041213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1045041223) 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, 22003 + ... + 50736.
It is an arithmetic number, because the mean of its divisors is an integer number (174212300).
Almost surely, 21045041213 is an apocalyptic number.
It is an amenable number.
1045041213 is a deficient number, since it is larger than the sum of its proper divisors (348657187).
1045041213 is an equidigital number, since it uses as much as digits as its factorization.
1045041213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77531.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1045041213 is about 32327.0971941497. The cubic root of 1045041213 is about 1014.7938018531.
Adding to 1045041213 its reverse (3121405401), we get a palindrome (4166446614).
The spelling of 1045041213 in words is "one billion, forty-five million, forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •