Base | Representation |
---|---|
bin | 111110111011000101110… |
… | …101100101110111000001 |
3 | 120022101010220201100122002 |
4 | 332323011311211313001 |
5 | 1031321131400310113 |
6 | 13110235524153345 |
7 | 624255100525406 |
oct | 76730565456701 |
9 | 16271126640562 |
10 | 4324056260033 |
11 | 1417905038104 |
12 | 59a045838855 |
13 | 2549ab791223 |
14 | 10d3dd3642ad |
15 | 7772a56ec58 |
hex | 3eec5d65dc1 |
4324056260033 has 6 divisors (see below), whose sum is σ = 4478303214294. Its totient is φ = 4174950870944.
The previous prime is 4324056260023. The next prime is 4324056260039. The reversal of 4324056260033 is 3300626504234.
It can be written as a sum of positive squares in 3 ways, for example, as 50293893169 + 4273762366864 = 224263^2 + 2067308^2 .
It is not a de Polignac number, because 4324056260033 - 26 = 4324056259969 is a prime.
It is a super-2 number, since 2×43240562600332 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4324056260039) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2570781716 + ... + 2570783397.
It is an arithmetic number, because the mean of its divisors is an integer number (746383869049).
Almost surely, 24324056260033 is an apocalyptic number.
It is an amenable number.
4324056260033 is a deficient number, since it is larger than the sum of its proper divisors (154246954261).
4324056260033 is an equidigital number, since it uses as much as digits as its factorization.
4324056260033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5141565171 (or 5141565142 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 38.
The spelling of 4324056260033 in words is "four trillion, three hundred twenty-four billion, fifty-six million, two hundred sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •