Search a number
-
+
15480904031 = 31499384001
BaseRepresentation
bin11100110101011101…
…11101100101011111
31110221220001101222222
432122232331211133
5223201102412111
611040053255555
71055426340665
oct163256754537
943856041888
1015480904031
11662462636a
1230006345bb
1315c9376358
14a6c048c35
156091597db
hex39abbd95f

15480904031 has 4 divisors (see below), whose sum is σ = 15980288064. Its totient is φ = 14981520000.

The previous prime is 15480904027. The next prime is 15480904051. The reversal of 15480904031 is 13040908451.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 15480904031 - 22 = 15480904027 is a prime.

It is a super-2 number, since 2×154809040312 (a number of 21 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 = 15480903982 and 15480904000.

It is a congruent number.

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

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

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

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

Almost surely, 215480904031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 499384032.

The product of its (nonzero) digits is 17280, while the sum is 35.

The spelling of 15480904031 in words is "fifteen billion, four hundred eighty million, nine hundred four thousand, thirty-one".

Divisors: 1 31 499384001 15480904031