Search a number
-
+
10501001315 = 572749109141
BaseRepresentation
bin10011100011110100…
…01001000001100011
31000002211111010201122
421301322021001203
5133001224020230
64454000522455
7521140016120
oct116172110143
930084433648
1010501001315
1144a95a5792
12205092042b
13cb473325c
147188d9747
15416d72be5
hex271e89063

10501001315 has 16 divisors (see below), whose sum is σ = 14406744000. Its totient is φ = 7198001280.

The previous prime is 10501001281. The next prime is 10501001333. The reversal of 10501001315 is 51310010501.

It is not a de Polignac number, because 10501001315 - 216 = 10500935779 is a prime.

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

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

It is an unprimeable number.

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

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

Almost surely, 210501001315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 111902.

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

Adding to 10501001315 its reverse (51310010501), we get a palindrome (61811011816).

The spelling of 10501001315 in words is "ten billion, five hundred one million, one thousand, three hundred fifteen".

Divisors: 1 5 7 35 2749 13745 19243 96215 109141 545705 763987 3819935 300028609 1500143045 2100200263 10501001315