Base | Representation |
---|---|
bin | 100111001101011110… |
… | …100000100000111001 |
3 | 11000200011101211220212 |
4 | 213031132200200321 |
5 | 1142211110014231 |
6 | 31201424400505 |
7 | 3020220241160 |
oct | 471536404071 |
9 | 130604354825 |
10 | 42102032441 |
11 | 16945555137 |
12 | 81aba76135 |
13 | 3c7c702541 |
14 | 20758263d7 |
15 | 116630142b |
hex | 9cd7a0839 |
42102032441 has 4 divisors (see below), whose sum is σ = 48116608512. Its totient is φ = 36087456372.
The previous prime is 42102032393. The next prime is 42102032501. The reversal of 42102032441 is 14423020124.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 42102032441 - 226 = 42034923577 is a prime.
It is a super-2 number, since 2×421020324412 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (42102032041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3007288025 + ... + 3007288038.
It is an arithmetic number, because the mean of its divisors is an integer number (12029152128).
Almost surely, 242102032441 is an apocalyptic number.
It is an amenable number.
42102032441 is a deficient number, since it is larger than the sum of its proper divisors (6014576071).
42102032441 is an equidigital number, since it uses as much as digits as its factorization.
42102032441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6014576070.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 42102032441 its reverse (14423020124), we get a palindrome (56525052565).
The spelling of 42102032441 in words is "forty-two billion, one hundred two million, thirty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •