Search a number
-
+
10150210015 = 511293629861
BaseRepresentation
bin10010111001111111…
…11110100111011111
3222012101102002112021
421130333332213133
5131241423210030
64355110121011
7506350235011
oct113477764737
928171362467
1010150210015
114339590020
121b73350167
13c59b60b3a
146c40a41b1
153e617e97a
hex25cffe9df

10150210015 has 16 divisors (see below), whose sum is σ = 13332918816. Its totient is φ = 7356764800.

The previous prime is 10150210013. The next prime is 10150210033. The reversal of 10150210015 is 51001205101.

It is not a de Polignac number, because 10150210015 - 21 = 10150210013 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 298816 + ... + 331045.

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

Almost surely, 210150210015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 630170.

The product of its (nonzero) digits is 50, while the sum is 16.

Adding to 10150210015 its reverse (51001205101), we get a palindrome (61151415116).

The spelling of 10150210015 in words is "ten billion, one hundred fifty million, two hundred ten thousand, fifteen".

Divisors: 1 5 11 55 293 1465 3223 16115 629861 3149305 6928471 34642355 184549273 922746365 2030042003 10150210015