Base | Representation |
---|---|
bin | 111101111000101011000… |
… | …110111111100000011101 |
3 | 120001120001211020111112002 |
4 | 331320223012333200131 |
5 | 1024134103131020232 |
6 | 13013403204052045 |
7 | 616151612003663 |
oct | 75705306774035 |
9 | 16046054214462 |
10 | 4252740876317 |
11 | 139a6393a085a |
12 | 588262394025 |
13 | 24b05498371b |
14 | 109b95b84c33 |
15 | 75954730b62 |
hex | 3de2b1bf81d |
4252740876317 has 4 divisors (see below), whose sum is σ = 4283336134560. Its totient is φ = 4222145618076.
The previous prime is 4252740876203. The next prime is 4252740876331. The reversal of 4252740876317 is 7136780472524.
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 4252740876317 - 220 = 4252739827741 is a prime.
It is a super-2 number, since 2×42527408763172 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4252740876347) 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, 15297628913 + ... + 15297629190.
It is an arithmetic number, because the mean of its divisors is an integer number (1070834033640).
Almost surely, 24252740876317 is an apocalyptic number.
It is an amenable number.
4252740876317 is a deficient number, since it is larger than the sum of its proper divisors (30595258243).
4252740876317 is a wasteful number, since it uses less digits than its factorization.
4252740876317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30595258242.
The product of its (nonzero) digits is 15805440, while the sum is 56.
The spelling of 4252740876317 in words is "four trillion, two hundred fifty-two billion, seven hundred forty million, eight hundred seventy-six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •