Search a number
-
+
2015025681 = 3671675227
BaseRepresentation
bin111100000011010…
…1101101000010001
312012102121220120210
41320012231220101
513111321310211
6531540554333
7100635302304
oct17006555021
95172556523
102015025681
1194447a689
124829b29a9
132616085b6
1415188ab3b
15bbd7e9a6
hex781ada11

2015025681 has 4 divisors (see below), whose sum is σ = 2686700912. Its totient is φ = 1343350452.

The previous prime is 2015025673. The next prime is 2015025703. The reversal of 2015025681 is 1865205102.

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 2015025681 - 23 = 2015025673 is a prime.

It is a super-2 number, since 2×20150256812 = 8120656990179027522, which contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 22015025681 is an apocalyptic number.

It is an amenable number.

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

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

2015025681 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 671675230.

The product of its (nonzero) digits is 4800, while the sum is 30.

The square root of 2015025681 is about 44889.0374256343. The cubic root of 2015025681 is about 1263.0683765137.

The spelling of 2015025681 in words is "two billion, fifteen million, twenty-five thousand, six hundred eighty-one".

Divisors: 1 3 671675227 2015025681