Search a number
-
+
483151001231 = 539239986693
BaseRepresentation
bin1110000011111100000…
…10110011011010001111
31201012002121211220002002
413001332002303122033
530403443124014411
61005542334422515
746622634515063
oct7017602633217
91635077756062
10483151001231
111769a3165328
127977a361a3b
133673a517212
141955560daa3
15c87b83733b
hex707e0b368f

483151001231 has 8 divisors (see below), whose sum is σ = 492320838240. Its totient is φ = 473983156192.

The previous prime is 483151001213. The next prime is 483151001243. The reversal of 483151001231 is 132100151384.

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 483151001231 - 26 = 483151001167 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3680 + ... + 983013.

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

Almost surely, 2483151001231 is an apocalyptic number.

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

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

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

The sum of its prime factors is 995985.

The product of its (nonzero) digits is 2880, while the sum is 29.

The spelling of 483151001231 in words is "four hundred eighty-three billion, one hundred fifty-one million, one thousand, two hundred thirty-one".

Divisors: 1 53 9239 489667 986693 52294729 9116056627 483151001231