Base | Representation |
---|---|
bin | 100111001110101111… |
… | …010110000011001001 |
3 | 11000201122021110020022 |
4 | 213032233112003021 |
5 | 1142232021120431 |
6 | 31203502510225 |
7 | 3020565330011 |
oct | 471657260311 |
9 | 130648243208 |
10 | 42123223241 |
11 | 169565090a0 |
12 | 81b6b95375 |
13 | 3c83c11988 |
14 | 2078580c41 |
15 | 11680da07b |
hex | 9cebd60c9 |
42123223241 has 32 divisors (see below), whose sum is σ = 48160407168. Its totient is φ = 36498608640.
The previous prime is 42123223217. The next prime is 42123223253. The reversal of 42123223241 is 14232232124.
It is a cyclic number.
It is not a de Polignac number, because 42123223241 - 214 = 42123206857 is a prime.
It is a super-2 number, since 2×421232232412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42123223241.
It is not an unprimeable number, because it can be changed into a prime (42123223211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19563821 + ... + 19565973.
It is an arithmetic number, because the mean of its divisors is an integer number (1505012724).
Almost surely, 242123223241 is an apocalyptic number.
It is an amenable number.
42123223241 is a deficient number, since it is larger than the sum of its proper divisors (6037183927).
42123223241 is a wasteful number, since it uses less digits than its factorization.
42123223241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161.
The product of its digits is 4608, while the sum is 26.
Adding to 42123223241 its reverse (14232232124), we get a palindrome (56355455365).
The spelling of 42123223241 in words is "forty-two billion, one hundred twenty-three million, two hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •