Base | Representation |
---|---|
bin | 1111110011001000011… |
… | …0010000110011111101 |
3 | 221221120222002110221111 |
4 | 3330302012100303331 |
5 | 13421333400122143 |
6 | 324405030202021 |
7 | 25416061122562 |
oct | 3746206206375 |
9 | 857528073844 |
10 | 271423442173 |
11 | a5123503464 |
12 | 4472b1b3311 |
13 | 1c7976323b0 |
14 | d1cbb8c869 |
15 | 70d8a0a99d |
hex | 3f32190cfd |
271423442173 has 4 divisors (see below), whose sum is σ = 292302168508. Its totient is φ = 250544715840.
The previous prime is 271423442123. The next prime is 271423442183. The reversal of 271423442173 is 371244324172.
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 11758799844 + 259664642329 = 108438^2 + 509573^2 .
It is a cyclic number.
It is not a de Polignac number, because 271423442173 - 229 = 270886571261 is a prime.
It is a super-2 number, since 2×2714234421732 (a number of 24 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 (271423442123) 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, 10439363148 + ... + 10439363173.
It is an arithmetic number, because the mean of its divisors is an integer number (73075542127).
Almost surely, 2271423442173 is an apocalyptic number.
It is an amenable number.
271423442173 is a deficient number, since it is larger than the sum of its proper divisors (20878726335).
271423442173 is a wasteful number, since it uses less digits than its factorization.
271423442173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20878726334.
The product of its digits is 225792, while the sum is 40.
The spelling of 271423442173 in words is "two hundred seventy-one billion, four hundred twenty-three million, four hundred forty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •