Search a number
-
+
101013020313 = 32910910652011
BaseRepresentation
bin101111000010011011…
…0000101111010011001
3100122201202211002212120
41132010312011322121
53123333313122223
6114223231331453
710204124335332
oct1360466057231
9318652732776
10101013020313
1139926242277
12176b1080b89
1396aa65814a
144c637db289
15296313dbe3
hex1784d85e99

101013020313 has 16 divisors (see below), whose sum is σ = 140606558400. Its totient is φ = 64423356480.

The previous prime is 101013020299. The next prime is 101013020359. The reversal of 101013020313 is 313020310101.

It is not a de Polignac number, because 101013020313 - 28 = 101013020057 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5316523 + ... + 5335488.

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

Almost surely, 2101013020313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10652152.

The product of its (nonzero) digits is 54, while the sum is 15.

Adding to 101013020313 its reverse (313020310101), we get a palindrome (414033330414).

The spelling of 101013020313 in words is "one hundred one billion, thirteen million, twenty thousand, three hundred thirteen".

Divisors: 1 3 29 87 109 327 3161 9483 10652011 31956033 308908319 926724957 1161069199 3483207597 33671006771 101013020313