Base | Representation |
---|---|
bin | 10100100101011010… |
… | …01110111001000001 |
3 | 1001112011220110102101 |
4 | 22102231032321001 |
5 | 140113110444401 |
6 | 5024334550401 |
7 | 540601131145 |
oct | 122255167101 |
9 | 31464813371 |
10 | 11051265601 |
11 | 4761173462 |
12 | 2185068401 |
13 | 1071736b1c |
14 | 76ba17225 |
15 | 44a319101 |
hex | 292b4ee41 |
11051265601 has 4 divisors (see below), whose sum is σ = 11084059012. Its totient is φ = 11018472192.
The previous prime is 11051265593. The next prime is 11051265619. The reversal of 11051265601 is 10656215011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10656215011 = 13 ⋅819708847.
It can be written as a sum of positive squares in 2 ways, for example, as 980942400 + 10070323201 = 31320^2 + 100351^2 .
It is a cyclic number.
It is not a de Polignac number, because 11051265601 - 23 = 11051265593 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11051265601.
It is not an unprimeable number, because it can be changed into a prime (11051205601) 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, 16396200 + ... + 16396873.
It is an arithmetic number, because the mean of its divisors is an integer number (2771014753).
Almost surely, 211051265601 is an apocalyptic number.
It is an amenable number.
11051265601 is a deficient number, since it is larger than the sum of its proper divisors (32793411).
11051265601 is an equidigital number, since it uses as much as digits as its factorization.
11051265601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32793410.
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 11051265601 in words is "eleven billion, fifty-one million, two hundred sixty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •