Search a number
-
+
11146264501 = 39728076233
BaseRepresentation
bin10100110000101111…
…00111111110110101
31001202210122220102011
422120113213332311
5140311420431001
65042011044221
7543133453651
oct123027477665
931683586364
1011146264501
1147aa859549
1221b0a40671
1310883191a8
1477a4a5a61
15453831d51
hex2985e7fb5

11146264501 has 4 divisors (see below), whose sum is σ = 11174341132. Its totient is φ = 11118187872.

The previous prime is 11146264477. The next prime is 11146264513. The reversal of 11146264501 is 10546264111.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10546264111 = 20275202893.

It can be written as a sum of positive squares in 2 ways, for example, as 6880868401 + 4265396100 = 82951^2 + 65310^2 .

It is a cyclic number.

It is not a de Polignac number, because 11146264501 - 27 = 11146264373 is a prime.

It is a super-3 number, since 3×111462645013 (a number of 31 digits) contains 333 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11146264201) 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, 14037720 + ... + 14038513.

It is an arithmetic number, because the mean of its divisors is an integer number (2793585283).

Almost surely, 211146264501 is an apocalyptic number.

It is an amenable number.

11146264501 is a deficient number, since it is larger than the sum of its proper divisors (28076631).

11146264501 is an equidigital number, since it uses as much as digits as its factorization.

11146264501 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 28076630.

The product of its (nonzero) digits is 5760, while the sum is 31.

The spelling of 11146264501 in words is "eleven billion, one hundred forty-six million, two hundred sixty-four thousand, five hundred one".

Divisors: 1 397 28076233 11146264501