Base | Representation |
---|---|
bin | 11000101000011… |
… | …011001010100101 |
3 | 1001210121021201110 |
4 | 120220123022211 |
5 | 1321243001323 |
6 | 105001215233 |
7 | 13145366055 |
oct | 3050331245 |
9 | 1053537643 |
10 | 413250213 |
11 | 1a22a6002 |
12 | b6491519 |
13 | 6780066c |
14 | 3cc53565 |
15 | 2642e793 |
hex | 18a1b2a5 |
413250213 has 8 divisors (see below), whose sum is σ = 552097728. Its totient is φ = 274951424.
The previous prime is 413250199. The next prime is 413250217. The reversal of 413250213 is 312052314.
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 413250213 - 226 = 346141349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 413250213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413250217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135420 + ... + 138437.
It is an arithmetic number, because the mean of its divisors is an integer number (69012216).
Almost surely, 2413250213 is an apocalyptic number.
It is an amenable number.
413250213 is a deficient number, since it is larger than the sum of its proper divisors (138847515).
413250213 is a wasteful number, since it uses less digits than its factorization.
413250213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274363.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 413250213 is about 20328.5565891925. The cubic root of 413250213 is about 744.8537844969.
It can be divided in two parts, 4132 and 50213, that added together give a palindrome (54345).
The spelling of 413250213 in words is "four hundred thirteen million, two hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •