Base | Representation |
---|---|
bin | 101010000111101… |
… | …1101010110110001 |
3 | 10122111110001000001 |
4 | 1110033131112301 |
5 | 10343303313140 |
6 | 352124430001 |
7 | 50011115353 |
oct | 12417352661 |
9 | 3574401001 |
10 | 1413338545 |
11 | 66587a193 |
12 | 3353a8301 |
13 | 196a6bac8 |
14 | d59c50d3 |
15 | 8412be9a |
hex | 543dd5b1 |
1413338545 has 8 divisors (see below), whose sum is σ = 1728006696. Its totient is φ = 1109337216.
The previous prime is 1413338539. The next prime is 1413338587. The reversal of 1413338545 is 5458333141.
It can be written as a sum of positive squares in 4 ways, for example, as 594920881 + 818417664 = 24391^2 + 28608^2 .
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 1413338545 - 29 = 1413338033 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 2666412 + ... + 2666941.
It is an arithmetic number, because the mean of its divisors is an integer number (216000837).
Almost surely, 21413338545 is an apocalyptic number.
It is an amenable number.
1413338545 is a deficient number, since it is larger than the sum of its proper divisors (314668151).
1413338545 is an equidigital number, since it uses as much as digits as its factorization.
1413338545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5333411.
The product of its digits is 86400, while the sum is 37.
The square root of 1413338545 is about 37594.3951274655. The cubic root of 1413338545 is about 1122.2304999644.
It can be divided in two parts, 141333 and 8545, that added together give a triangular number (149878 = T547).
The spelling of 1413338545 in words is "one billion, four hundred thirteen million, three hundred thirty-eight thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •