Search a number
-
+
105650051016601 = 7132940034123159
BaseRepresentation
bin11000000001011010010001…
…110000101110011110011001
3111212002001020201002210102201
4120001122101300232132121
5102321432301030012401
61012410544032330201
731152651516315550
oct3001322160563631
9455061221083381
10105650051016601
1130732a31564863
12ba238303a3961
1346c49ac35a460
141c136bdc4cd97
15c33300e2eb01
hex601691c2e799

105650051016601 has 16 divisors (see below), whose sum is σ = 134514653817600. Its totient is φ = 80708792286528.

The previous prime is 105650051016599. The next prime is 105650051016647. The reversal of 105650051016601 is 106610150056501.

It is not a de Polignac number, because 105650051016601 - 21 = 105650051016599 is a prime.

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

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

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

Almost surely, 2105650051016601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 40034123208.

The product of its (nonzero) digits is 27000, while the sum is 37.

The spelling of 105650051016601 in words is "one hundred five trillion, six hundred fifty billion, fifty-one million, sixteen thousand, six hundred one".

Divisors: 1 7 13 29 91 203 377 2639 40034123159 280238862113 520443601067 1160989571611 3643105207469 8126927001277 15092864430943 105650051016601