Search a number
-
+
146101051 = 19472592
BaseRepresentation
bin10001011010101…
…01001100111011
3101011220200222001
420231111030323
5244400213201
622255241431
73422560405
oct1055251473
9334820861
10146101051
1175519978
1240b19277
1324365335
1415591b75
15cc5e301
hex8b5533b

146101051 has 18 divisors (see below), whose sum is σ = 159840740. Its totient is φ = 133170552.

The previous prime is 146101027. The next prime is 146101061. The reversal of 146101051 is 150101641.

It is not a de Polignac number, because 146101051 - 215 = 146068283 is a prime.

It is a super-3 number, since 3×1461010513 (a number of 25 digits) contains 333 as substring.

It is a Harshad number since it is a multiple of its sum of digits (19).

It is a Duffinian number.

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

It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2476260 + ... + 2476318.

Almost surely, 2146101051 is an apocalyptic number.

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

146101051 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 120, while the sum is 19.

The square root of 146101051 is about 12087.2267704383. The cubic root of 146101051 is about 526.6851983456.

Multiplying 146101051 by its sum of digits (19), we get a square (2775919969 = 526872).

146101051 divided by its sum of digits (19) gives a square (7689529 = 27732).

Adding to 146101051 its reverse (150101641), we get a palindrome (296202692).

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

Divisors: 1 19 47 59 893 1121 2209 2773 3481 41971 52687 66139 130331 163607 2476289 3108533 7689529 146101051