Search a number
-
+
10270671470 = 251027067147
BaseRepresentation
bin10011001000010111…
…00000001001101110
3222111210002011120122
421210023200021232
5132013242441340
64415052044542
7512342160413
oct114413401156
928453064518
1010270671470
1143a0587544
121ba7763752
13c78ab9ac7
146d60a010a
15401a26db5
hex2642e026e

10270671470 has 8 divisors (see below), whose sum is σ = 18487208664. Its totient is φ = 4108268584.

The previous prime is 10270671461. The next prime is 10270671539. The reversal of 10270671470 is 7417607201.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10270671470.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 210270671470 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1027067154.

The product of its (nonzero) digits is 16464, while the sum is 35.

The spelling of 10270671470 in words is "ten billion, two hundred seventy million, six hundred seventy-one thousand, four hundred seventy".

Divisors: 1 2 5 10 1027067147 2054134294 5135335735 10270671470