Base | Representation |
---|---|
bin | 10000011001001000101… |
… | …01001000001111100001 |
3 | 1222211211212200112022021 |
4 | 20030210111020033201 |
5 | 33212014024444322 |
6 | 1110430435141441 |
7 | 55456602666040 |
oct | 10144425101741 |
9 | 1884755615267 |
10 | 563250234337 |
11 | 1a796708973a |
12 | 911b3444881 |
13 | 4116408473b |
14 | 1d39361a557 |
15 | e9b88a84c7 |
hex | 83245483e1 |
563250234337 has 32 divisors (see below), whose sum is σ = 661329047808. Its totient is φ = 469668519936.
The previous prime is 563250234271. The next prime is 563250234341. The reversal of 563250234337 is 733432052365.
It is a de Polignac number, because none of the positive numbers 2k-563250234337 is a prime.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 563250234293 and 563250234302.
It is not an unprimeable number, because it can be changed into a prime (563250234347) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 107631673 + ... + 107636905.
It is an arithmetic number, because the mean of its divisors is an integer number (20666532744).
Almost surely, 2563250234337 is an apocalyptic number.
It is an amenable number.
563250234337 is a deficient number, since it is larger than the sum of its proper divisors (98078813471).
563250234337 is a wasteful number, since it uses less digits than its factorization.
563250234337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6649.
The product of its (nonzero) digits is 1360800, while the sum is 43.
The spelling of 563250234337 in words is "five hundred sixty-three billion, two hundred fifty million, two hundred thirty-four thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •