Search a number
-
+
10030686537 = 33343562179
BaseRepresentation
bin10010101011110000…
…00010000101001001
3221220001111200010210
421111320002011021
5131020323432122
64335200231333
7503366300034
oct112570020511
927801450123
1010030686537
114288074293
121b3b30b549
13c3b172aa1
146b227001b
153da92040c
hex255e02149

10030686537 has 4 divisors (see below), whose sum is σ = 13374248720. Its totient is φ = 6687124356.

The previous prime is 10030686509. The next prime is 10030686539. The reversal of 10030686537 is 73568603001.

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 not a de Polignac number, because 10030686537 - 216 = 10030621001 is a prime.

It is a super-2 number, since 2×100306865372 (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 = 10030686495 and 10030686504.

It is not an unprimeable number, because it can be changed into a prime (10030686539) 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, 1671781087 + ... + 1671781092.

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

Almost surely, 210030686537 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3343562182.

The product of its (nonzero) digits is 90720, while the sum is 39.

The spelling of 10030686537 in words is "ten billion, thirty million, six hundred eighty-six thousand, five hundred thirty-seven".

Divisors: 1 3 3343562179 10030686537