Base | Representation |
---|---|
bin | 100111001101100011… |
… | …011011000111010001 |
3 | 11000200020211022112210 |
4 | 213031203123013101 |
5 | 1142211422233131 |
6 | 31201512142333 |
7 | 3020234216055 |
oct | 471543330721 |
9 | 130606738483 |
10 | 42103321041 |
11 | 169462552a1 |
12 | 81b03979a9 |
13 | 3c7ca63c22 |
14 | 2075a7dc65 |
15 | 11664a8146 |
hex | 9cd8db1d1 |
42103321041 has 4 divisors (see below), whose sum is σ = 56137761392. Its totient is φ = 28068880692.
The previous prime is 42103321037. The next prime is 42103321063. The reversal of 42103321041 is 14012330124.
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 not a de Polignac number, because 42103321041 - 22 = 42103321037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42103320999 and 42103321017.
It is not an unprimeable number, because it can be changed into a prime (42103328041) 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 3 ways as a sum of consecutive naturals, for example, 7017220171 + ... + 7017220176.
It is an arithmetic number, because the mean of its divisors is an integer number (14034440348).
Almost surely, 242103321041 is an apocalyptic number.
It is an amenable number.
42103321041 is a deficient number, since it is larger than the sum of its proper divisors (14034440351).
42103321041 is a wasteful number, since it uses less digits than its factorization.
42103321041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14034440350.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 42103321041 its reverse (14012330124), we get a palindrome (56115651165).
The spelling of 42103321041 in words is "forty-two billion, one hundred three million, three hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •