Search a number
-
+
105650530003654 = 252825265001827
BaseRepresentation
bin11000000001011010101110…
…010011111010101011000110
3111212002002111002101212010221
4120001122232103322223012
5102321434241140104104
61012411103342534554
731152666423534346
oct3001325623725306
9455062432355127
10105650530003654
1130733157979929
12ba2394489745a
1346c4a5766604c
141c137276d4d26
15c3332cee6c54
hex6016ae4faac6

105650530003654 has 4 divisors (see below), whose sum is σ = 158475795005484. Its totient is φ = 52825265001826.

The previous prime is 105650530003649. The next prime is 105650530003691. The reversal of 105650530003654 is 456300035056501.

It is a semiprime because it is the product of two primes.

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

It is a self number, because there is not a number n which added to its sum of digits gives 105650530003654.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26412632500912 + ... + 26412632500915.

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

Almost surely, 2105650530003654 is an apocalyptic number.

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

105650530003654 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 52825265001829.

The product of its (nonzero) digits is 810000, while the sum is 43.

The spelling of 105650530003654 in words is "one hundred five trillion, six hundred fifty billion, five hundred thirty million, three thousand, six hundred fifty-four".

Divisors: 1 2 52825265001827 105650530003654