Base | Representation |
---|---|
bin | 110100011101000001… |
… | …001101001100011111 |
3 | 12101101010201002210010 |
4 | 310131001031030133 |
5 | 1410321241232203 |
6 | 41512415414303 |
7 | 4032461154465 |
oct | 643501151437 |
9 | 171333632703 |
10 | 56321430303 |
11 | 21981a85216 |
12 | aab9b24393 |
13 | 54075caa28 |
14 | 2a240d0835 |
15 | 16e9821303 |
hex | d1d04d31f |
56321430303 has 16 divisors (see below), whose sum is σ = 77328394880. Its totient is φ = 36436399776.
The previous prime is 56321430301. The next prime is 56321430311. The reversal of 56321430303 is 30303412365.
56321430303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56321430303 - 21 = 56321430301 is a prime.
It is a super-2 number, since 2×563214303032 (a number of 22 digits) contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56321430301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 627325 + ... + 711462.
It is an arithmetic number, because the mean of its divisors is an integer number (4833024680).
Almost surely, 256321430303 is an apocalyptic number.
56321430303 is a deficient number, since it is larger than the sum of its proper divisors (21006964577).
56321430303 is a wasteful number, since it uses less digits than its factorization.
56321430303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1339206.
The product of its (nonzero) digits is 19440, while the sum is 30.
Adding to 56321430303 its reverse (30303412365), we get a palindrome (86624842668).
The spelling of 56321430303 in words is "fifty-six billion, three hundred twenty-one million, four hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •