Search a number
-
+
10201303133 = 7109131102061
BaseRepresentation
bin10011000000000101…
…11000100001011101
3222022221112220002222
421200002320201131
5131343013200013
64404133155125
7510540434360
oct114002704135
928287486088
1010201303133
11436540803a
121b8848baa5
13c6760c958
146caba40d7
153ea8c3508
hex2600b885d

10201303133 has 16 divisors (see below), whose sum is σ = 11855521920. Its totient is φ = 8597534400.

The previous prime is 10201303103. The next prime is 10201303159. The reversal of 10201303133 is 33130310201.

It is not a de Polignac number, because 10201303133 - 210 = 10201302109 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10201303103) by changing a digit.

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 15 ways as a sum of consecutive naturals, for example, 48923 + ... + 150983.

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

Almost surely, 210201303133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 102308.

The product of its (nonzero) digits is 162, while the sum is 17.

Adding to 10201303133 its reverse (33130310201), we get a palindrome (43331613334).

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

Divisors: 1 7 109 131 763 917 14279 99953 102061 714427 11124649 13369991 77872543 93589937 1457329019 10201303133