Search a number
-
+
143495641 = 143999719
BaseRepresentation
bin10001000110110…
…01000111011001
3101000000100000101
420203121013121
5243213330031
622123335401
73361456432
oct1043310731
9330010011
10143495641
1173aaa443
1240081561
1323962483
14150b4489
15c8e7361
hex88d91d9

143495641 has 4 divisors (see below), whose sum is σ = 143596800. Its totient is φ = 143394484.

The previous prime is 143495609. The next prime is 143495659. The reversal of 143495641 is 146594341.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 143495641 - 25 = 143495609 is a prime.

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 143495641.

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

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

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

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

Almost surely, 2143495641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 101158.

The product of its digits is 51840, while the sum is 37.

The square root of 143495641 is about 11978.9666081845. The cubic root of 143495641 is about 523.5356211053.

The spelling of 143495641 in words is "one hundred forty-three million, four hundred ninety-five thousand, six hundred forty-one".

Divisors: 1 1439 99719 143495641