105064150147 has 24 divisors (see below), whose sum is σ = 123778670400. Its totient is φ = 88381404720.

The previous prime is 105064150133. The next prime is 105064150153. The reversal of 105064150147 is 741051460501.

It is not a de Polignac number, because 105064150147 - 2¹¹ = 105064148099 is a prime.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 136897 + ... + 478402.

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

Almost surely, 2^105064150147 is an apocalyptic number.

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

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

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

The sum of its prime factors is 615391 (or 615372 counting only the distinct ones).

The product of its (nonzero) digits is 16800, while the sum is 34.

The spelling of 105064150147 in words is "one hundred five billion, sixty-four million, one hundred fifty thousand, one hundred forty-seven".