Search a number
-
+
1101305531513 = 111937971387781
BaseRepresentation
bin10000000001101010111…
…011001100110001111001
310220021122212122122021202
4100001222323030301321
5121020433204002023
62201533251343545
7142365243363605
oct20015273146171
93807585578252
101101305531513
11395074297160
12159534bb1bb5
137cb113cbc25
143b436a28505
151d9aa3d5128
hex1006aeccc79

1101305531513 has 16 divisors (see below), whose sum is σ = 1264991048640. Its totient is φ = 948242318400.

The previous prime is 1101305531507. The next prime is 1101305531533. The reversal of 1101305531513 is 3151355031011.

It is a cyclic number.

It is not a de Polignac number, because 1101305531513 - 240 = 1793903737 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99683 + ... + 1487463.

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

Almost surely, 21101305531513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1391608.

The product of its (nonzero) digits is 3375, while the sum is 29.

The spelling of 1101305531513 in words is "one trillion, one hundred one billion, three hundred five million, five hundred thirty-one thousand, five hundred thirteen".

Divisors: 1 11 19 209 3797 41767 72143 793573 1387781 15265591 26367839 290046229 5269404457 57963449027 100118684683 1101305531513