Search a number
-
+
13099485031 = 171105969677
BaseRepresentation
bin11000011001100101…
…00100011101100111
31020210220222210021021
430030302210131213
5203311432010111
610003503232011
7642421533313
oct141462443547
936726883237
1013099485031
115612354a96
122656ba8607
131309b94c99
148c3a64b43
1551a053d71
hex30cca4767

13099485031 has 8 divisors (see below), whose sum is σ = 13871496240. Its totient is φ = 12327635328.

The previous prime is 13099485029. The next prime is 13099485037. The reversal of 13099485031 is 13058499031.

13099485031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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 13099485031 - 21 = 13099485029 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 213099485031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 80753.

The product of its (nonzero) digits is 116640, while the sum is 43.

The spelling of 13099485031 in words is "thirteen billion, ninety-nine million, four hundred eighty-five thousand, thirty-one".

Divisors: 1 17 11059 69677 188003 1184509 770557943 13099485031