Base | Representation |
---|---|
bin | 101010000011110… |
… | …1111000101100101 |
3 | 10122100122011212200 |
4 | 1110013233011211 |
5 | 10342244022041 |
6 | 352013205113 |
7 | 46654654065 |
oct | 12407570545 |
9 | 3570564780 |
10 | 1411314021 |
11 | 664717127 |
12 | 334790799 |
13 | 196510470 |
14 | d56193a5 |
15 | 83d7c1b6 |
hex | 541ef165 |
1411314021 has 12 divisors (see below), whose sum is σ = 2195377548. Its totient is φ = 868500864.
The previous prime is 1411314001. The next prime is 1411314031. The reversal of 1411314021 is 1204131141.
It can be written as a sum of positive squares in 2 ways, for example, as 966525921 + 444788100 = 31089^2 + 21090^2 .
It is not a de Polignac number, because 1411314021 - 218 = 1411051877 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1411313985 and 1411314003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1411314001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6031140 + ... + 6031373.
It is an arithmetic number, because the mean of its divisors is an integer number (182948129).
Almost surely, 21411314021 is an apocalyptic number.
It is an amenable number.
1411314021 is a deficient number, since it is larger than the sum of its proper divisors (784063527).
1411314021 is a wasteful number, since it uses less digits than its factorization.
1411314021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12062532 (or 12062529 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 1411314021 is about 37567.4596026934. The cubic root of 1411314021 is about 1121.6944009337.
Adding to 1411314021 its reverse (1204131141), we get a palindrome (2615445162).
The spelling of 1411314021 in words is "one billion, four hundred eleven million, three hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •