Search a number
-
+
105546145051 = 233452987747
BaseRepresentation
bin110001001001100001…
…0100101110100011011
3101002102200200200222101
41202103002211310123
53212124303120201
6120253124104231
710424350300414
oct1422302456433
9332380620871
10105546145051
1140842057a56
1218557235077
139c5085bc89
14517388a80b
152b2b0c1d01
hex18930a5d1b

105546145051 has 4 divisors (see below), whose sum is σ = 105999133032. Its totient is φ = 105093157072.

The previous prime is 105546145049. The next prime is 105546145069. The reversal of 105546145051 is 150541645501.

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

It is a cyclic number.

It is not a de Polignac number, because 105546145051 - 21 = 105546145049 is a prime.

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

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 226493641 + ... + 226494106.

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

Almost surely, 2105546145051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 452987980.

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

The spelling of 105546145051 in words is "one hundred five billion, five hundred forty-six million, one hundred forty-five thousand, fifty-one".

Divisors: 1 233 452987747 105546145051