Search a number
-
+
10150275021 = 36175483671
BaseRepresentation
bin10010111010000000…
…01110011111001101
3222012101112101200220
421131000032133031
5131241432300041
64355111341553
7506350625355
oct113500163715
928171471626
1010150275021
114339624947
121b733818b9
13c59b845c3
146c40bdb65
153e6193d66
hex25d00e7cd

10150275021 has 8 divisors (see below), whose sum is σ = 13555637184. Its totient is φ = 6755881440.

The previous prime is 10150274987. The next prime is 10150275029. The reversal of 10150275021 is 12057205101.

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

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

It is not a de Polignac number, because 10150275021 - 215 = 10150242253 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10150274982 and 10150275000.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210150275021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5484291.

The product of its (nonzero) digits is 700, while the sum is 24.

The spelling of 10150275021 in words is "ten billion, one hundred fifty million, two hundred seventy-five thousand, twenty-one".

Divisors: 1 3 617 1851 5483671 16451013 3383425007 10150275021