Search a number
-
+
1105214641 = 4999772267
BaseRepresentation
bin100000111100000…
…0011110010110001
32212000122201110121
41001320003302301
54230413332031
6301400330241
736250112056
oct10170036261
92760581417
101105214641
11517957133
1226a173981
13147c8837b
14a6ad902d
1567066011
hex41e03cb1

1105214641 has 8 divisors (see below), whose sum is σ = 1109052000. Its totient is φ = 1101384768.

The previous prime is 1105214623. The next prime is 1105214651. The reversal of 1105214641 is 1464125011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1105214641 - 227 = 970996913 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 486390 + ... + 488656.

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

Almost surely, 21105214641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3743.

The product of its (nonzero) digits is 960, while the sum is 25.

The square root of 1105214641 is about 33244.7686260560. The cubic root of 1105214641 is about 1033.9087477008.

Adding to 1105214641 its reverse (1464125011), we get a palindrome (2569339652).

The spelling of 1105214641 in words is "one billion, one hundred five million, two hundred fourteen thousand, six hundred forty-one".

Divisors: 1 499 977 2267 487523 1131233 2214859 1105214641