Base | Representation |
---|---|
bin | 110111010110100010100001… |
… | …111100011100011101011111 |
3 | 1011220221202222010221022122011 |
4 | 313112202201330130131133 |
5 | 223402021104102024041 |
6 | 2221431244144132051 |
7 | 102164031255032545 |
oct | 6726424174343537 |
9 | 1156852863838564 |
10 | 243441463314271 |
11 | 70627a43598172 |
12 | 23378705607027 |
13 | a5ab57bc93251 |
14 | 44188b5c39d95 |
15 | 1d227100cee81 |
hex | dd68a1f1c75f |
243441463314271 has 8 divisors (see below), whose sum is σ = 243493649093520. Its totient is φ = 243389278785408.
The previous prime is 243441463314233. The next prime is 243441463314299. The reversal of 243441463314271 is 172413364144342.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 243441463314271 - 223 = 243441454925663 is a prime.
It is a super-2 number, since 2×2434414633142712 (a number of 30 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 (243441464314271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 461624775 + ... + 462151831.
It is an arithmetic number, because the mean of its divisors is an integer number (30436706136690).
Almost surely, 2243441463314271 is an apocalyptic number.
243441463314271 is a deficient number, since it is larger than the sum of its proper divisors (52185779249).
243441463314271 is an equidigital number, since it uses as much as digits as its factorization.
243441463314271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 625193.
The product of its digits is 4644864, while the sum is 49.
The spelling of 243441463314271 in words is "two hundred forty-three trillion, four hundred forty-one billion, four hundred sixty-three million, three hundred fourteen thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •