Base | Representation |
---|---|
bin | 111101101011101111010… |
… | …011001100111110100101 |
3 | 120000020012220220000222102 |
4 | 331223233103030332211 |
5 | 1023422132222323443 |
6 | 13003145120541445 |
7 | 615150501056321 |
oct | 75535723147645 |
9 | 16006186800872 |
10 | 4238852542373 |
11 | 1394761831a19 |
12 | 585627181885 |
13 | 249950541347 |
14 | 109239458981 |
15 | 753e0308cb8 |
hex | 3daef4ccfa5 |
4238852542373 has 4 divisors (see below), whose sum is σ = 4238858808768. Its totient is φ = 4238846275980.
The previous prime is 4238852542333. The next prime is 4238852542381. The reversal of 4238852542373 is 3732452588324.
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 4238852542373 - 228 = 4238584106917 is a prime.
It is a super-2 number, since 2×42388525423732 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4238852542333) 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, 1976093 + ... + 3518898.
It is an arithmetic number, because the mean of its divisors is an integer number (1059714702192).
Almost surely, 24238852542373 is an apocalyptic number.
It is an amenable number.
4238852542373 is a deficient number, since it is larger than the sum of its proper divisors (6266395).
4238852542373 is an equidigital number, since it uses as much as digits as its factorization.
4238852542373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6266394.
The product of its digits is 38707200, while the sum is 56.
The spelling of 4238852542373 in words is "four trillion, two hundred thirty-eight billion, eight hundred fifty-two million, five hundred forty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •