Search a number
-
+
15728670690 = 235524289023
BaseRepresentation
bin11101010011000000…
…00111011111100010
31111121011021020221220
432221200013133202
5224203014430230
611120423555510
71064525331525
oct165140073742
944534236856
1015728670690
1167414740a7
12306b5bbb96
1316387b6345
14a92d02bbc
15620c9bd10
hex3a98077e2

15728670690 has 16 divisors (see below), whose sum is σ = 37748809728. Its totient is φ = 4194312176.

The previous prime is 15728670689. The next prime is 15728670707. The reversal of 15728670690 is 9607682751.

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

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

It is an unprimeable number.

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, 262144482 + ... + 262144541.

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

Almost surely, 215728670690 is an apocalyptic number.

15728670690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

15728670690 is an abundant number, since it is smaller than the sum of its proper divisors (22020139038).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 524289033.

The product of its (nonzero) digits is 1270080, while the sum is 51.

The spelling of 15728670690 in words is "fifteen billion, seven hundred twenty-eight million, six hundred seventy thousand, six hundred ninety".

Divisors: 1 2 3 5 6 10 15 30 524289023 1048578046 1572867069 2621445115 3145734138 5242890230 7864335345 15728670690