Search a number
-
+
10201123010 = 2513591330003
BaseRepresentation
bin10011000000000100…
…01100100011000010
3222022221012202000202
421200002030203002
5131342441414020
64404125245202
7510536054261
oct114002144302
928287182022
1010201123010
1143652a4781
121b88403802
13c67578980
146cab585d8
153ea889e75
hex26008c8c2

10201123010 has 32 divisors (see below), whose sum is σ = 20109660480. Its totient is φ = 3702725568.

The previous prime is 10201122979. The next prime is 10201123013. The reversal of 10201123010 is 1032110201.

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

It is not an unprimeable number, because it can be changed into a prime (10201123013) 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, 657332 + ... + 672671.

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

Almost surely, 210201123010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1330082.

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

Adding to 10201123010 its reverse (1032110201), we get a palindrome (11233233211).

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

Divisors: 1 2 5 10 13 26 59 65 118 130 295 590 767 1534 3835 7670 1330003 2660006 6650015 13300030 17290039 34580078 78470177 86450195 156940354 172900390 392350885 784701770 1020112301 2040224602 5100561505 10201123010