Search a number
-
+
10501006010 = 251195463691
BaseRepresentation
bin10011100011110100…
…01010001010111010
31000002211111101011112
421301322022022322
5133001224143020
64454001000322
7521140035605
oct116172121272
930084441145
1010501006010
1144a95a9270
1220509230a2
13cb4735431
147188db33c
15416d742c5
hex271e8a2ba

10501006010 has 16 divisors (see below), whose sum is σ = 20620157472. Its totient is φ = 3818547600.

The previous prime is 10501005941. The next prime is 10501006037. The reversal of 10501006010 is 1060010501.

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

It is a super-2 number, since 2×105010060102 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is an unprimeable number.

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, 47731736 + ... + 47731955.

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

Almost surely, 210501006010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 95463709.

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

Adding to 10501006010 its reverse (1060010501), we get a palindrome (11561016511).

The spelling of 10501006010 in words is "ten billion, five hundred one million, six thousand, ten".

Divisors: 1 2 5 10 11 22 55 110 95463691 190927382 477318455 954636910 1050100601 2100201202 5250503005 10501006010