Base | Representation |
---|---|
bin | 101010010111010… |
… | …1001001001011001 |
3 | 10200001211100122221 |
4 | 1110232221021121 |
5 | 10402401411210 |
6 | 353015544041 |
7 | 50140443442 |
oct | 12456511131 |
9 | 3601740587 |
10 | 1421513305 |
11 | 66a452a93 |
12 | 33808b021 |
13 | 198671944 |
14 | d6b122c9 |
15 | 84be41da |
hex | 54ba9259 |
1421513305 has 8 divisors (see below), whose sum is σ = 1729183752. Its totient is φ = 1121632128.
The previous prime is 1421513287. The next prime is 1421513311. The reversal of 1421513305 is 5033151241.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 268435456 + 1153077849 = 16384^2 + 33957^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 1421513305 - 211 = 1421511257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1421513305.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1946914 + ... + 1947643.
It is an arithmetic number, because the mean of its divisors is an integer number (216147969).
Almost surely, 21421513305 is an apocalyptic number.
It is an amenable number.
1421513305 is a deficient number, since it is larger than the sum of its proper divisors (307670447).
1421513305 is an equidigital number, since it uses as much as digits as its factorization.
1421513305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3894635.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 1421513305 is about 37702.9614884560. The cubic root of 1421513305 is about 1124.3900047827.
Adding to 1421513305 its reverse (5033151241), we get a palindrome (6454664546).
The spelling of 1421513305 in words is "one billion, four hundred twenty-one million, five hundred thirteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •