Search a number
-
+
10210101315 = 3517151265163
BaseRepresentation
bin10011000001001000…
…11100100001000011
3222100120002212221120
421200210130201003
5131402241220230
64405045523323
7511005300141
oct114044344103
928316085846
1010210101315
11436a377267
121b8b413543
13c693a048b
146cc014591
153eb560310
hex26091c843

10210101315 has 32 divisors (see below), whose sum is σ = 17411728896. Its totient is φ = 5091110400.

The previous prime is 10210101299. The next prime is 10210101361. The reversal of 10210101315 is 51310101201.

It is not a de Polignac number, because 10210101315 - 24 = 10210101299 is a prime.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 94077 + ... + 171086.

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

Almost surely, 210210101315 is an apocalyptic number.

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

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

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

10210101315 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 265339.

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

Adding to 10210101315 its reverse (51310101201), we get a palindrome (61520202516).

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

Divisors: 1 3 5 15 17 51 85 151 255 453 755 2265 2567 7701 12835 38505 265163 795489 1325815 3977445 4507771 13523313 22538855 40039613 67616565 120118839 200198065 600594195 680673421 2042020263 3403367105 10210101315