Base | Representation |
---|---|
bin | 111010111110000110010… |
… | …001010010000010011001 |
3 | 112100101222012101212202222 |
4 | 322332012101102002121 |
5 | 1012343312122244101 |
6 | 12341352222233425 |
7 | 565530263530406 |
oct | 72760621220231 |
9 | 15311865355688 |
10 | 4052406837401 |
11 | 132268601723a |
12 | 555472a25875 |
13 | 2351a93a92b0 |
14 | 1001cd58d2ad |
15 | 7062bcc701b |
hex | 3af86452099 |
4052406837401 has 8 divisors (see below), whose sum is σ = 4367053522440. Its totient is φ = 3738177735552.
The previous prime is 4052406837389. The next prime is 4052406837419. The reversal of 4052406837401 is 1047386042504.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 287565135001 + 3764841702400 = 536251^2 + 1940320^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4052406837401 - 226 = 4052339728537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4052406837701) 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 7 ways as a sum of consecutive naturals, for example, 104375636 + ... + 104414453.
It is an arithmetic number, because the mean of its divisors is an integer number (545881690305).
Almost surely, 24052406837401 is an apocalyptic number.
It is an amenable number.
4052406837401 is a deficient number, since it is larger than the sum of its proper divisors (314646685039).
4052406837401 is a wasteful number, since it uses less digits than its factorization.
4052406837401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208791595.
The product of its (nonzero) digits is 645120, while the sum is 44.
The spelling of 4052406837401 in words is "four trillion, fifty-two billion, four hundred six million, eight hundred thirty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •