Base | Representation |
---|---|
bin | 111100001000000010100001… |
… | …100000001010101011011101 |
3 | 1021200021202121122202021002101 |
4 | 330020002201200022223131 |
5 | 234130001401021404003 |
6 | 2334223513553325101 |
7 | 106461550104641410 |
oct | 7410024140125335 |
9 | 1250252548667071 |
10 | 264435256044253 |
11 | 772913a9251278 |
12 | 257a93a8266791 |
13 | b4721a3545678 |
14 | 4942a3dd79b77 |
15 | 208887b7a111d |
hex | f080a180aadd |
264435256044253 has 16 divisors (see below), whose sum is σ = 303033342528000. Its totient is φ = 226042933300272.
The previous prime is 264435256044227. The next prime is 264435256044257. The reversal of 264435256044253 is 352440652534462.
It is a cyclic number.
It is not a de Polignac number, because 264435256044253 - 221 = 264435253947101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 264435256044194 and 264435256044203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264435256044257) 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 15 ways as a sum of consecutive naturals, for example, 6077143 + ... + 23786596.
It is an arithmetic number, because the mean of its divisors is an integer number (18939583908000).
Almost surely, 2264435256044253 is an apocalyptic number.
It is an amenable number.
264435256044253 is a deficient number, since it is larger than the sum of its proper divisors (38598086483747).
264435256044253 is a wasteful number, since it uses less digits than its factorization.
264435256044253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29867184.
The product of its (nonzero) digits is 82944000, while the sum is 55.
The spelling of 264435256044253 in words is "two hundred sixty-four trillion, four hundred thirty-five billion, two hundred fifty-six million, forty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •