Base | Representation |
---|---|
bin | 11111000011111100100… |
… | …11111101100010011101 |
3 | 10210000210221202220200001 |
4 | 33201332103331202131 |
5 | 114441232342121141 |
6 | 2134144134334301 |
7 | 140051654153251 |
oct | 17417623754235 |
9 | 3700727686601 |
10 | 1067271051421 |
11 | 381699759563 |
12 | 152a16aba391 |
13 | 79849232203 |
14 | 39928852261 |
15 | 1cb674c4a31 |
hex | f87e4fd89d |
1067271051421 has 4 divisors (see below), whose sum is σ = 1104073501500. Its totient is φ = 1030468601344.
The previous prime is 1067271051401. The next prime is 1067271051437. The reversal of 1067271051421 is 1241501727601.
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 281415396196 + 785855655225 = 530486^2 + 886485^2 .
It is a cyclic number.
It is not a de Polignac number, because 1067271051421 - 217 = 1067270920349 is a prime.
It is a super-2 number, since 2×10672710514212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1067271051401) 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, 18401224996 + ... + 18401225053.
It is an arithmetic number, because the mean of its divisors is an integer number (276018375375).
Almost surely, 21067271051421 is an apocalyptic number.
It is an amenable number.
1067271051421 is a deficient number, since it is larger than the sum of its proper divisors (36802450079).
1067271051421 is an equidigital number, since it uses as much as digits as its factorization.
1067271051421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36802450078.
The product of its (nonzero) digits is 23520, while the sum is 37.
The spelling of 1067271051421 in words is "one trillion, sixty-seven billion, two hundred seventy-one million, fifty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •