Search a number
-
+
483500131 = 7137318257
BaseRepresentation
bin11100110100011…
…010000001100011
31020200210100111021
4130310122001203
51442234001011
6115551030311
714660453242
oct3464320143
91220710437
10483500131
11228a17894
12115b0b397
1379228b6a
14482dc959
152c6a9471
hex1cd1a063

483500131 has 8 divisors (see below), whose sum is σ = 491651424. Its totient is φ = 475386240.

The previous prime is 483500119. The next prime is 483500153. The reversal of 483500131 is 131005384.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 483500131 - 29 = 483499619 is a prime.

It is a super-2 number, since 2×4835001312 = 467544753354034322, which contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 483500096 and 483500105.

It is not an unprimeable number, because it can be changed into a prime (483500161) 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 7 ways as a sum of consecutive naturals, for example, 17355 + ... + 35611.

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

Almost surely, 2483500131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 18701.

The product of its (nonzero) digits is 1440, while the sum is 25.

The square root of 483500131 is about 21988.6364061076. The cubic root of 483500131 is about 784.8720529296.

The spelling of 483500131 in words is "four hundred eighty-three million, five hundred thousand, one hundred thirty-one".

Divisors: 1 71 373 18257 26483 1296247 6809861 483500131