Base | Representation |
---|---|
bin | 101010000111001… |
… | …0111000010100101 |
3 | 10122110220101220221 |
4 | 1110032113002211 |
5 | 10343220104113 |
6 | 352114324341 |
7 | 50005505566 |
oct | 12416270245 |
9 | 3573811827 |
10 | 1413050533 |
11 | 6656a2864 |
12 | 3352896b1 |
13 | 19699a99b |
14 | d594c16d |
15 | 840c198d |
hex | 543970a5 |
1413050533 has 4 divisors (see below), whose sum is σ = 1413387808. Its totient is φ = 1412713260.
The previous prime is 1413050521. The next prime is 1413050621. The reversal of 1413050533 is 3350503141.
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 1413050533 - 29 = 1413050021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1413050498 and 1413050507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413053533) 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, 162273 + ... + 170758.
It is an arithmetic number, because the mean of its divisors is an integer number (353346952).
Almost surely, 21413050533 is an apocalyptic number.
It is an amenable number.
1413050533 is a deficient number, since it is larger than the sum of its proper divisors (337275).
1413050533 is an equidigital number, since it uses as much as digits as its factorization.
1413050533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337274.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 1413050533 is about 37590.5644144910. The cubic root of 1413050533 is about 1122.1542649133.
Adding to 1413050533 its reverse (3350503141), we get a palindrome (4763553674).
The spelling of 1413050533 in words is "one billion, four hundred thirteen million, fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •