Search a number
-
+
156970013 = 157999809
BaseRepresentation
bin10010101101100…
…10110000011101
3101221100220101012
421112302300131
5310141020023
623324225005
73614136344
oct1126626035
9357326335
10156970013
1180672992
124469b165
132669c585
1416bc0b5b
15dba9978
hex95b2c1d

156970013 has 4 divisors (see below), whose sum is σ = 157969980. Its totient is φ = 155970048.

The previous prime is 156970007. The next prime is 156970063. The reversal of 156970013 is 310079651.

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

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 96098809 + 60871204 = 9803^2 + 7802^2 .

It is a cyclic number.

It is not a de Polignac number, because 156970013 - 24 = 156969997 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2156970013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 999966.

The product of its (nonzero) digits is 5670, while the sum is 32.

The square root of 156970013 is about 12528.7674174278. The cubic root of 156970013 is about 539.4347228265.

The spelling of 156970013 in words is "one hundred fifty-six million, nine hundred seventy thousand, thirteen".

Divisors: 1 157 999809 156970013