Search a number
-
+
1101050050061 = 132312292996291
BaseRepresentation
bin10000000001011011101…
…100100111011000001101
310220021000001220211121202
4100001123230213120031
5121014422303100221
62201452043435245
7142356022001663
oct20013354473015
93807001824552
101101050050061
11394a5305a165
12159483525b25
137caa04ba580
143b410b22c33
151d992c6bd0b
hex1005bb2760d

1101050050061 has 16 divisors (see below), whose sum is σ = 1238307557760. Its totient is φ = 971373247680.

The previous prime is 1101050050021. The next prime is 1101050050069. The reversal of 1101050050061 is 1600500501011.

It is a cyclic number.

It is not a de Polignac number, because 1101050050061 - 26 = 1101050049997 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101050050069) 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, 1130675 + ... + 1865616.

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

Almost surely, 21101050050061 is an apocalyptic number.

It is an amenable number.

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

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

1101050050061 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2997556.

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 1101050050061 its reverse (1600500501011), we get a palindrome (2701550551072).

The spelling of 1101050050061 in words is "one trillion, one hundred one billion, fifty million, fifty thousand, sixty-one".

Divisors: 1 13 23 299 1229 15977 28267 367471 2996291 38951783 68914693 895891009 3682441639 47871741307 84696157697 1101050050061