Search a number
-
+
10210321010 = 251021032101
BaseRepresentation
bin10011000001001010…
…10010001001110010
3222100120112001022102
421200211102021302
5131402320233020
64405054340402
7511010203511
oct114045221162
928316461272
1010210321010
11436a50732a
121b8b4ba702
13c69449486
146cc070678
153eb5a5475
hex260952272

10210321010 has 8 divisors (see below), whose sum is σ = 18378577836. Its totient is φ = 4084128400.

The previous prime is 10210321007. The next prime is 10210321063. The reversal of 10210321010 is 1012301201.

It can be written as a sum of positive squares in 2 ways, for example, as 10178590321 + 31730689 = 100889^2 + 5633^2 .

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

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

It is an unprimeable number.

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

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

Almost surely, 210210321010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1021032108.

The product of its (nonzero) digits is 12, while the sum is 11.

Adding to 10210321010 its reverse (1012301201), we get a palindrome (11222622211).

The spelling of 10210321010 in words is "ten billion, two hundred ten million, three hundred twenty-one thousand, ten".

Divisors: 1 2 5 10 1021032101 2042064202 5105160505 10210321010