Base | Representation |
---|---|
bin | 100111001101100010… |
… | …101100100011011011 |
3 | 11000200020110121221110 |
4 | 213031202230203123 |
5 | 1142211400132311 |
6 | 31201504111403 |
7 | 3020232463053 |
oct | 471542544333 |
9 | 130606417843 |
10 | 42103130331 |
11 | 16946134a89 |
12 | 81b0305563 |
13 | 3c7c9c8192 |
14 | 2075a30563 |
15 | 116646b8a6 |
hex | 9cd8ac8db |
42103130331 has 8 divisors (see below), whose sum is σ = 56148562944. Its totient is φ = 28063225640.
The previous prime is 42103130327. The next prime is 42103130341. The reversal of 42103130331 is 13303130124.
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 42103130331 - 22 = 42103130327 is a prime.
It is a super-2 number, since 2×421031303312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42103130298 and 42103130307.
It is not an unprimeable number, because it can be changed into a prime (42103130341) 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 7 ways as a sum of consecutive naturals, for example, 1364175 + ... + 1394696.
It is an arithmetic number, because the mean of its divisors is an integer number (7018570368).
Almost surely, 242103130331 is an apocalyptic number.
42103130331 is a deficient number, since it is larger than the sum of its proper divisors (14045432613).
42103130331 is a wasteful number, since it uses less digits than its factorization.
42103130331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2763961.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 42103130331 its reverse (13303130124), we get a palindrome (55406260455).
The spelling of 42103130331 in words is "forty-two billion, one hundred three million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •