Search a number
-
+
1101044243351 = 13378232781377
BaseRepresentation
bin10000000001011011010…
…110011101101110010111
310220020222122222211022102
4100001123112131232113
5121014414311241401
62201451315152315
7142355621435543
oct20013326355627
93806878884272
101101044243351
11394a4a853528
121594815a569b
137ca9c236550
143b410050a23
151d9924c156b
hex1005b59db97

1101044243351 has 16 divisors (see below), whose sum is σ = 1219267111104. Its totient is φ = 987677743104.

The previous prime is 1101044243287. The next prime is 1101044243503. The reversal of 1101044243351 is 1533424401011.

It is not a de Polignac number, because 1101044243351 - 26 = 1101044243287 is a prime.

It is a super-2 number, since 2×11010442433512 (a number of 25 digits) contains 22 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 (1101044248351) by changing a digit.

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

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

Almost surely, 21101044243351 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2782250.

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

Adding to 1101044243351 its reverse (1533424401011), we get a palindrome (2634468644362).

The spelling of 1101044243351 in words is "one trillion, one hundred one billion, forty-four million, two hundred forty-three thousand, three hundred fifty-one".

Divisors: 1 13 37 481 823 10699 30451 395863 2781377 36157901 102910949 1337842337 2289073271 29757952523 84695711027 1101044243351