Search a number
-
+
10201101000 = 23353101131257
BaseRepresentation
bin10011000000000100…
…00111001011001000
3222022221011121211120
421200002013023020
5131342440213000
64404124555240
7510535633146
oct114002071310
928287147746
1010201101000
11436528a192
121b883b2b20
13c6756b94c
146cab50596
153ea8836a0
hex2600872c8

10201101000 has 256 divisors, whose sum is σ = 32513944320. Its totient is φ = 2662400000.

The previous prime is 10201100977. The next prime is 10201101011. The reversal of 10201101000 is 10110201.

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

It is a Harshad number since it is a multiple of its sum of digits (6).

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a self number, because there is not a number n which added to its sum of digits gives 10201101000.

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 63 ways as a sum of consecutive naturals, for example, 39692872 + ... + 39693128.

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

Almost surely, 210201101000 is an apocalyptic number.

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

It is a pronic number, being equal to 101000×101001.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10201101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16256972160).

10201101000 is an abundant number, since it is smaller than the sum of its proper divisors (22312843320).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 513 (or 499 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 6.

Adding to 10201101000 its reverse (10110201), we get a palindrome (10211211201).

It can be divided in two parts, 10201 and 101000, that multiplied together give a cube (1030301000 = 10103).

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