Base | Representation |
---|---|
bin | 101010010101010… |
… | …0001100010011001 |
3 | 10122222210111112102 |
4 | 1110222201202121 |
5 | 10402112333221 |
6 | 352540453145 |
7 | 50125325501 |
oct | 12452414231 |
9 | 3588714472 |
10 | 1420433561 |
11 | 669885838 |
12 | 33784a1b5 |
13 | 198384341 |
14 | d6910a01 |
15 | 84a7e30b |
hex | 54aa1899 |
1420433561 has 4 divisors (see below), whose sum is σ = 1455078324. Its totient is φ = 1385788800.
The previous prime is 1420433527. The next prime is 1420433569. The reversal of 1420433561 is 1653340241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 94090000 + 1326343561 = 9700^2 + 36419^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1420433561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1420433569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17322320 + ... + 17322401.
It is an arithmetic number, because the mean of its divisors is an integer number (363769581).
Almost surely, 21420433561 is an apocalyptic number.
It is an amenable number.
1420433561 is a deficient number, since it is larger than the sum of its proper divisors (34644763).
1420433561 is an equidigital number, since it uses as much as digits as its factorization.
1420433561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34644762.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 1420433561 is about 37688.6396809436. The cubic root of 1420433561 is about 1124.1052470121.
The spelling of 1420433561 in words is "one billion, four hundred twenty million, four hundred thirty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •