Base | Representation |
---|---|
bin | 11001100000110101010110… |
… | …00100111010000000000001 |
3 | 21100122110112121122201220110 |
4 | 30300122223010322000001 |
5 | 24323200421122313213 |
6 | 315153411002501533 |
7 | 14550234543112203 |
oct | 1460325304720001 |
9 | 240573477581813 |
10 | 56103733010433 |
11 | 16970506732629 |
12 | 63613428048a9 |
13 | 253c736aa3404 |
14 | dbd61414c773 |
15 | 6745c09195c3 |
hex | 3306ab13a001 |
56103733010433 has 32 divisors (see below), whose sum is σ = 79235567646336. Its totient is φ = 35188879638528.
The previous prime is 56103733010417. The next prime is 56103733010443. The reversal of 56103733010433 is 33401033730165.
It is not a de Polignac number, because 56103733010433 - 24 = 56103733010417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56103733010391 and 56103733010400.
It is not an unprimeable number, because it can be changed into a prime (56103733010443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1636948785 + ... + 1636983057.
It is an arithmetic number, because the mean of its divisors is an integer number (2476111488948).
Almost surely, 256103733010433 is an apocalyptic number.
It is an amenable number.
56103733010433 is a deficient number, since it is larger than the sum of its proper divisors (23131834635903).
56103733010433 is a wasteful number, since it uses less digits than its factorization.
56103733010433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45633.
The product of its (nonzero) digits is 204120, while the sum is 39.
Adding to 56103733010433 its reverse (33401033730165), we get a palindrome (89504766740598).
The spelling of 56103733010433 in words is "fifty-six trillion, one hundred three billion, seven hundred thirty-three million, ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •