Search a number
-
+
6314115070 = 25631411507
BaseRepresentation
bin1011110000101100…
…11011111111111110
3121022001010021112201
411320112123333332
5100412403140240
62522313222114
7312320043514
oct57026337776
917261107481
106314115070
11275017611a
12128270193a
13798199483
1443c8184b4
1526e4d3d9a
hex17859bffe

6314115070 has 8 divisors (see below), whose sum is σ = 11365407144. Its totient is φ = 2525646024.

The previous prime is 6314115019. The next prime is 6314115077. The reversal of 6314115070 is 705114136.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

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

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

Almost surely, 26314115070 is an apocalyptic number.

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

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

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

The sum of its prime factors is 631411514.

The product of its (nonzero) digits is 2520, while the sum is 28.

The square root of 6314115070 is about 79461.4061667675. The cubic root of 6314115070 is about 1848.2930512864.

The spelling of 6314115070 in words is "six billion, three hundred fourteen million, one hundred fifteen thousand, seventy".

Divisors: 1 2 5 10 631411507 1262823014 3157057535 6314115070