Base | Representation |
---|---|
bin | 10011010010100101011111… |
… | …01001110111010001110111 |
3 | 12120012022112210200001111111 |
4 | 21221102233221313101313 |
5 | 21030002222231034143 |
6 | 230115255454015451 |
7 | 11635514143464463 |
oct | 1151225751672167 |
9 | 176168483601444 |
10 | 42420044002423 |
11 | 1257526aa50a0a |
12 | 4911356aa7587 |
13 | 1a89267cb0319 |
14 | a691d91c94a3 |
15 | 4d869915199d |
hex | 2694afa77477 |
42420044002423 has 4 divisors (see below), whose sum is σ = 42420059534160. Its totient is φ = 42420028470688.
The previous prime is 42420044002379. The next prime is 42420044002489. The reversal of 42420044002423 is 32420044002424.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42420044002423 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42420044002723) 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, 2461315 + ... + 9534052.
It is an arithmetic number, because the mean of its divisors is an integer number (10605014883540).
Almost surely, 242420044002423 is an apocalyptic number.
42420044002423 is a deficient number, since it is larger than the sum of its proper divisors (15531737).
42420044002423 is a wasteful number, since it uses less digits than its factorization.
42420044002423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15531736.
The product of its (nonzero) digits is 49152, while the sum is 31.
Adding to 42420044002423 its reverse (32420044002424), we get a palindrome (74840088004847).
Subtracting from 42420044002423 its reverse (32420044002424), we obtain a palindrome (9999999999999).
The spelling of 42420044002423 in words is "forty-two trillion, four hundred twenty billion, forty-four million, two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •