Base | Representation |
---|---|
bin | 111010110100110011001… |
… | …000110000111110010111 |
3 | 112022110012100110210002112 |
4 | 322310303020300332113 |
5 | 1012212340033130203 |
6 | 12333021344101235 |
7 | 565024663300511 |
oct | 72646310607627 |
9 | 15273170423075 |
10 | 4042422161303 |
11 | 1319421a19309 |
12 | 55354700481b |
13 | 234277925a26 |
14 | dd923498bb1 |
15 | 702454446d8 |
hex | 3ad33230f97 |
4042422161303 has 4 divisors (see below), whose sum is σ = 4118694277608. Its totient is φ = 3966150045000.
The previous prime is 4042422161291. The next prime is 4042422161321. The reversal of 4042422161303 is 3031612242404.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4042422161303 - 28 = 4042422161047 is a prime.
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 4042422161303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4042422161353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38136058073 + ... + 38136058178.
It is an arithmetic number, because the mean of its divisors is an integer number (1029673569402).
Almost surely, 24042422161303 is an apocalyptic number.
4042422161303 is a deficient number, since it is larger than the sum of its proper divisors (76272116305).
4042422161303 is an equidigital number, since it uses as much as digits as its factorization.
4042422161303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76272116304.
The product of its (nonzero) digits is 27648, while the sum is 32.
The spelling of 4042422161303 in words is "four trillion, forty-two billion, four hundred twenty-two million, one hundred sixty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •