Base | Representation |
---|---|
bin | 101111011000011001100… |
… | …111101110010110101101 |
3 | 102112021100021202112210112 |
4 | 233120121213232112231 |
5 | 411321304323214003 |
6 | 10531443114345405 |
7 | 454145042212133 |
oct | 57303147562655 |
9 | 12467307675715 |
10 | 3256015054253 |
11 | 1045960683245 |
12 | 447054a2b265 |
13 | 1a806bb28aa0 |
14 | b3840515753 |
15 | 59a6a66b3d8 |
hex | 2f6199ee5ad |
3256015054253 has 24 divisors (see below), whose sum is σ = 3726093420840. Its totient is φ = 2827829329920.
The previous prime is 3256015054241. The next prime is 3256015054261. The reversal of 3256015054253 is 3524505106523.
It can be written as a sum of positive squares in 12 ways, for example, as 547005201604 + 2709009852649 = 739598^2 + 1645907^2 .
It is not a de Polignac number, because 3256015054253 - 210 = 3256015053229 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3256015054253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3256015054213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11465093 + ... + 11745653.
It is an arithmetic number, because the mean of its divisors is an integer number (155253892535).
Almost surely, 23256015054253 is an apocalyptic number.
It is an amenable number.
3256015054253 is a deficient number, since it is larger than the sum of its proper divisors (470078366587).
3256015054253 is a wasteful number, since it uses less digits than its factorization.
3256015054253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283697 (or 283680 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 3256015054253 in words is "three trillion, two hundred fifty-six billion, fifteen million, fifty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •