Search a number
-
+
1000690770 = 23533356359
BaseRepresentation
bin111011101001010…
…101010001010010
32120201222100200010
4323221111101102
54022134101040
6243144135350
733540505542
oct7351252122
92521870603
101000690770
11473955872
1223b167556
1312c41c721
1496c8b322
155ccbae80
hex3ba55452

1000690770 has 16 divisors (see below), whose sum is σ = 2401657920. Its totient is φ = 266850864.

The previous prime is 1000690763. The next prime is 1000690781. The reversal of 1000690770 is 770960001.

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

It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 33356359 = 1000690770 / (1 + 0 + 0 + 0 + 6 + 9 + 0 + 7 + 7 + 0).

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16678150 + ... + 16678209.

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

Almost surely, 21000690770 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 33356369.

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

The square root of 1000690770 is about 31633.6967488784. The cubic root of 1000690770 is about 1000.2302036689.

The spelling of 1000690770 in words is "one billion, six hundred ninety thousand, seven hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 33356359 66712718 100069077 166781795 200138154 333563590 500345385 1000690770