Base | Representation |
---|---|
bin | 100111110010111110… |
… | …011111010011110001 |
3 | 11002022000020111122221 |
4 | 213302332133103301 |
5 | 1200003140014410 |
6 | 31344101201041 |
7 | 3041626656415 |
oct | 476276372361 |
9 | 132260214587 |
10 | 42731173105 |
11 | 171386a68a5 |
12 | 8346700181 |
13 | 404cb61c1a |
14 | 20d51d6d45 |
15 | 11a16784da |
hex | 9f2f9f4f1 |
42731173105 has 8 divisors (see below), whose sum is σ = 51279688872. Its totient is φ = 34183417728.
The previous prime is 42731173103. The next prime is 42731173117. The reversal of 42731173105 is 50137113724.
It can be written as a sum of positive squares in 4 ways, for example, as 215619856 + 42515553249 = 14684^2 + 206193^2 .
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 42731173105 - 21 = 42731173103 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42731173103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58134 + ... + 298063.
It is an arithmetic number, because the mean of its divisors is an integer number (6409961109).
Almost surely, 242731173105 is an apocalyptic number.
It is an amenable number.
42731173105 is a deficient number, since it is larger than the sum of its proper divisors (8548515767).
42731173105 is a wasteful number, since it uses less digits than its factorization.
42731173105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380195.
The product of its (nonzero) digits is 17640, while the sum is 34.
Adding to 42731173105 its reverse (50137113724), we get a palindrome (92868286829).
The spelling of 42731173105 in words is "forty-two billion, seven hundred thirty-one million, one hundred seventy-three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •