Base | Representation |
---|---|
bin | 101010001101010… |
… | …0100101001110101 |
3 | 10122200221001112120 |
4 | 1110122210221311 |
5 | 10400030031041 |
6 | 352311110153 |
7 | 50044641432 |
oct | 12432445165 |
9 | 3580831476 |
10 | 1416252021 |
11 | 66748a118 |
12 | 336372359 |
13 | 19754bc62 |
14 | d6142b89 |
15 | 84505366 |
hex | 546a4a75 |
1416252021 has 4 divisors (see below), whose sum is σ = 1888336032. Its totient is φ = 944168012.
The previous prime is 1416252011. The next prime is 1416252037. The reversal of 1416252021 is 1202526141.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1416252021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1416251982 and 1416252000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1416252011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236042001 + ... + 236042006.
It is an arithmetic number, because the mean of its divisors is an integer number (472084008).
Almost surely, 21416252021 is an apocalyptic number.
It is an amenable number.
1416252021 is a deficient number, since it is larger than the sum of its proper divisors (472084011).
1416252021 is an equidigital number, since it uses as much as digits as its factorization.
1416252021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472084010.
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 1416252021 is about 37633.1239867221. The cubic root of 1416252021 is about 1123.0010979569.
Adding to 1416252021 its reverse (1202526141), we get a palindrome (2618778162).
The spelling of 1416252021 in words is "one billion, four hundred sixteen million, two hundred fifty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •