Base | Representation |
---|---|
bin | 101010000111101… |
… | …1011011001100011 |
3 | 10122111102122000020 |
4 | 1110033123121203 |
5 | 10343303034111 |
6 | 352124324523 |
7 | 50011053114 |
oct | 12417333143 |
9 | 3574378006 |
10 | 1413330531 |
11 | 665874168 |
12 | 3353a3743 |
13 | 196a68272 |
14 | d59c220b |
15 | 84129906 |
hex | 543db663 |
1413330531 has 8 divisors (see below), whose sum is σ = 1884638400. Its totient is φ = 942121512.
The previous prime is 1413330469. The next prime is 1413330553. The reversal of 1413330531 is 1350333141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1413330531 - 29 = 1413330019 is a prime.
It is a super-3 number, since 3×14133305313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (1413330031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20436 + ... + 56958.
It is an arithmetic number, because the mean of its divisors is an integer number (235579800).
Almost surely, 21413330531 is an apocalyptic number.
1413330531 is a deficient number, since it is larger than the sum of its proper divisors (471307869).
1413330531 is a wasteful number, since it uses less digits than its factorization.
1413330531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49425.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 1413330531 is about 37594.2885422773. The cubic root of 1413330531 is about 1122.2283788467.
Adding to 1413330531 its reverse (1350333141), we get a palindrome (2763663672).
The spelling of 1413330531 in words is "one billion, four hundred thirteen million, three hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •