Search a number
-
+
105013043409 = 32512693111667
BaseRepresentation
bin110000111001101000…
…0111110000011010001
3101001001112120100000010
41201303100332003101
53210031314342114
6120124201545133
710405215066261
oct1416320760321
9331045510003
10105013043409
114059914188a
12184287a51a9
139b97287211
145122b597a1
152ae93bac59
hex187343e0d1

105013043409 has 32 divisors (see below), whose sum is σ = 141636418560. Its totient is φ = 69205640000.

The previous prime is 105013043363. The next prime is 105013043479. The reversal of 105013043409 is 904340310501.

It is a cyclic number.

It is not a de Polignac number, because 105013043409 - 28 = 105013043153 is a prime.

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62994394 + ... + 62996060.

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

Almost surely, 2105013043409 is an apocalyptic number.

It is an amenable number.

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

105013043409 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 2501.

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

The spelling of 105013043409 in words is "one hundred five billion, thirteen million, forty-three thousand, four hundred nine".

Divisors: 1 3 251 269 311 753 807 933 1667 5001 67519 78061 83659 202557 234183 250977 418417 448423 518437 1255251 1345269 1555311 20998409 62995227 112554173 130127687 139459553 337662519 390383061 418378659 35004347803 105013043409