Base | Representation |
---|---|
bin | 111010001101011110101… |
… | …001010011110100100101 |
3 | 112011102012222121201100221 |
4 | 322031132221103310211 |
5 | 1011014403311034343 |
6 | 12301400113004341 |
7 | 562001513502115 |
oct | 72153651236445 |
9 | 15142188551327 |
10 | 4000202439973 |
11 | 1302526aa0833 |
12 | 5473238536b1 |
13 | 2302a9a284bc |
14 | db87a199045 |
15 | 6e0c3b475ed |
hex | 3a35ea53d25 |
4000202439973 has 2 divisors, whose sum is σ = 4000202439974. Its totient is φ = 4000202439972.
The previous prime is 4000202439971. The next prime is 4000202440007. The reversal of 4000202439973 is 3799342020004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2154457389249 + 1845745050724 = 1467807^2 + 1358582^2 .
It is a cyclic number.
It is not a de Polignac number, because 4000202439973 - 21 = 4000202439971 is a prime.
Together with 4000202439971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4000202439971) 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 as a sum of consecutive naturals, namely, 2000101219986 + 2000101219987.
It is an arithmetic number, because the mean of its divisors is an integer number (2000101219987).
Almost surely, 24000202439973 is an apocalyptic number.
It is an amenable number.
4000202439973 is a deficient number, since it is larger than the sum of its proper divisors (1).
4000202439973 is an equidigital number, since it uses as much as digits as its factorization.
4000202439973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 43.
Adding to 4000202439973 its reverse (3799342020004), we get a palindrome (7799544459977).
The spelling of 4000202439973 in words is "four trillion, two hundred two million, four hundred thirty-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •