Base | Representation |
---|---|
bin | 11000101000011… |
… | …001101010000001 |
3 | 1001210120222020120 |
4 | 120220121222001 |
5 | 1321242302113 |
6 | 105001130453 |
7 | 13145342046 |
oct | 3050315201 |
9 | 1053528216 |
10 | 413244033 |
11 | 1a22a13a4 |
12 | b6489a29 |
13 | 677ca8c7 |
14 | 3cc511cd |
15 | 2642ca23 |
hex | 18a19a81 |
413244033 has 4 divisors (see below), whose sum is σ = 550992048. Its totient is φ = 275496020.
The previous prime is 413243993. The next prime is 413244037. The reversal of 413244033 is 330442314.
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 a cyclic number.
It is not a de Polignac number, because 413244033 - 214 = 413227649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 413243994 and 413244012.
It is not an unprimeable number, because it can be changed into a prime (413244037) 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 3 ways as a sum of consecutive naturals, for example, 68874003 + ... + 68874008.
It is an arithmetic number, because the mean of its divisors is an integer number (137748012).
Almost surely, 2413244033 is an apocalyptic number.
It is an amenable number.
413244033 is a deficient number, since it is larger than the sum of its proper divisors (137748015).
413244033 is a wasteful number, since it uses less digits than its factorization.
413244033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137748014.
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 413244033 is about 20328.4045857022. The cubic root of 413244033 is about 744.8500714765.
Adding to 413244033 its reverse (330442314), we get a palindrome (743686347).
The spelling of 413244033 in words is "four hundred thirteen million, two hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •