Base | Representation |
---|---|
bin | 100111011011101111… |
… | …011001100001001101 |
3 | 11001021211200222220111 |
4 | 213123233121201031 |
5 | 1143203340410021 |
6 | 31241253520021 |
7 | 3026154314422 |
oct | 473357314115 |
9 | 131254628814 |
10 | 42341341261 |
11 | 16a5864641a |
12 | 8258043011 |
13 | 3cba1708ab |
14 | 209951bd49 |
15 | 117c3228e1 |
hex | 9dbbd984d |
42341341261 has 4 divisors (see below), whose sum is σ = 44832008412. Its totient is φ = 39850674112.
The previous prime is 42341341253. The next prime is 42341341277. The reversal of 42341341261 is 16214314324.
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 36717841161 + 5623500100 = 191619^2 + 74990^2 .
It is a cyclic number.
It is not a de Polignac number, because 42341341261 - 23 = 42341341253 is a prime.
It is a super-2 number, since 2×423413412612 (a number of 22 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 (42341341291) 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, 1245333550 + ... + 1245333583.
It is an arithmetic number, because the mean of its divisors is an integer number (11208002103).
Almost surely, 242341341261 is an apocalyptic number.
It is an amenable number.
42341341261 is a deficient number, since it is larger than the sum of its proper divisors (2490667151).
42341341261 is a wasteful number, since it uses less digits than its factorization.
42341341261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2490667150.
The product of its digits is 13824, while the sum is 31.
Adding to 42341341261 its reverse (16214314324), we get a palindrome (58555655585).
The spelling of 42341341261 in words is "forty-two billion, three hundred forty-one million, three hundred forty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •