Base | Representation |
---|---|
bin | 101010001001110… |
… | …1011100111011010 |
3 | 10122120112021111111 |
4 | 1110103223213122 |
5 | 10344044224110 |
6 | 352204250534 |
7 | 50023405621 |
oct | 12423534732 |
9 | 3576467444 |
10 | 1414445530 |
11 | 666465953 |
12 | 335840a4a |
13 | 197068924 |
14 | d5bd26b8 |
15 | 84299e8a |
hex | 544eb9da |
1414445530 has 8 divisors (see below), whose sum is σ = 2546001972. Its totient is φ = 565778208.
The previous prime is 1414445489. The next prime is 1414445533. The reversal of 1414445530 is 355444141.
It can be written as a sum of positive squares in 2 ways, for example, as 1414436881 + 8649 = 37609^2 + 93^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1414445492 and 1414445501.
It is not an unprimeable number, because it can be changed into a prime (1414445533) 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 3 ways as a sum of consecutive naturals, for example, 70722267 + ... + 70722286.
Almost surely, 21414445530 is an apocalyptic number.
1414445530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1414445530 is a deficient number, since it is larger than the sum of its proper divisors (1131556442).
1414445530 is a wasteful number, since it uses less digits than its factorization.
1414445530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141444560.
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 1414445530 is about 37609.1149855989. The cubic root of 1414445530 is about 1122.5234158967.
Adding to 1414445530 its reverse (355444141), we get a palindrome (1769889671).
The spelling of 1414445530 in words is "one billion, four hundred fourteen million, four hundred forty-five thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •