Base | Representation |
---|---|
bin | 101000110100101000111… |
… | …1000101101111000001101 |
3 | 201212100221102211102101010 |
4 | 1101221101320231320031 |
5 | 1213411002341023203 |
6 | 15533250301235433 |
7 | 1116231632366361 |
oct | 121512170557015 |
9 | 21770842742333 |
10 | 5610601111053 |
11 | 1873496071764 |
12 | 767456b62b79 |
13 | 319101106443 |
14 | 1557a99452a1 |
15 | 9ae280d9303 |
hex | 51a51e2de0d |
5610601111053 has 4 divisors (see below), whose sum is σ = 7480801481408. Its totient is φ = 3740400740700.
The previous prime is 5610601111051. The next prime is 5610601111103. The reversal of 5610601111053 is 3501111060165.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5610601111053 - 21 = 5610601111051 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5610601111053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5610601111051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 935100185173 + ... + 935100185178.
It is an arithmetic number, because the mean of its divisors is an integer number (1870200370352).
Almost surely, 25610601111053 is an apocalyptic number.
It is an amenable number.
5610601111053 is a deficient number, since it is larger than the sum of its proper divisors (1870200370355).
5610601111053 is a wasteful number, since it uses less digits than its factorization.
5610601111053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870200370354.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 5610601111053 in words is "five trillion, six hundred ten billion, six hundred one million, one hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •