Search a number
-
+
10201023110 = 251020102311
BaseRepresentation
bin10011000000000011…
…10100001010000110
3222022221000122222202
421200001310022012
5131342430214420
64404123154502
7510535160105
oct114001641206
928287018882
1010201023110
114365236713
121b88375a32
13c67542365
146cab3003c
153ea86a575
hex260074286

10201023110 has 8 divisors (see below), whose sum is σ = 18361841616. Its totient is φ = 4080409240.

The previous prime is 10201023109. The next prime is 10201023127. The reversal of 10201023110 is 1132010201.

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

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 210201023110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1020102318.

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

Adding to 10201023110 its reverse (1132010201), we get a palindrome (11333033311).

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

Divisors: 1 2 5 10 1020102311 2040204622 5100511555 10201023110