[go: up one dir, main page]

Search a number
-
+
10902070 = 252334679
BaseRepresentation
bin101001100101…
…101000110110
3202111212211101
4221211220312
510242331240
61025400314
7161444314
oct51455066
922455741
1010902070
116176983
12379909a
13234933a
14163b0b4
15e5539a
hexa65a36

10902070 has 16 divisors (see below), whose sum is σ = 19712160. Its totient is φ = 4341184.

The previous prime is 10902053. The next prime is 10902077. The reversal of 10902070 is 7020901.

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

It is a congruent number.

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

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

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

Almost surely, 210902070 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 4919.

The product of its (nonzero) digits is 126, while the sum is 19.

The square root of 10902070 is about 3301.8282814223. The cubic root of 10902070 is about 221.7360578226.

Adding to 10902070 its reverse (7020901), we get a palindrome (17922971).

It can be divided in two parts, 1090 and 2070, that added together give a triangular number (3160 = T79).

The spelling of 10902070 in words is "ten million, nine hundred two thousand, seventy".

Divisors: 1 2 5 10 233 466 1165 2330 4679 9358 23395 46790 1090207 2180414 5451035 10902070