Search a number
-
+
11014910481 = 33671636827
BaseRepresentation
bin10100100001000101…
…00011001000010001
31001102122111102120110
422100202203020101
5140024304113411
65020555431533
7536650123431
oct122042431021
931378442513
1011014910481
1147426a2303
122174a555a9
131067048313
14766c722c1
154470372a6
hex2908a3211

11014910481 has 4 divisors (see below), whose sum is σ = 14686547312. Its totient is φ = 7343273652.

The previous prime is 11014910461. The next prime is 11014910497. The reversal of 11014910481 is 18401941011.

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 11014910481 - 25 = 11014910449 is a prime.

It is a super-2 number, since 2×110149104812 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (11014910441) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1835818411 + ... + 1835818416.

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

Almost surely, 211014910481 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3671636830.

The product of its (nonzero) digits is 1152, while the sum is 30.

The spelling of 11014910481 in words is "eleven billion, fourteen million, nine hundred ten thousand, four hundred eighty-one".

Divisors: 1 3 3671636827 11014910481