Search a number
-
+
10055301015 = 351783475091
BaseRepresentation
bin10010101110101011…
…11011011110010111
3221221202211012212010
421113111323132113
5131043124113030
64341435555303
7504115435254
oct112725733627
927852735763
1010055301015
11429aa56531
121b475bbb33
13c432b0676
146b563a42b
153dcb836b0
hex25757b797

10055301015 has 32 divisors (see below), whose sum is σ = 17240138496. Its totient is φ = 4986544640.

The previous prime is 10055301001. The next prime is 10055301059. The reversal of 10055301015 is 51010355001.

It is not a de Polignac number, because 10055301015 - 26 = 10055300951 is a prime.

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

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

It is a congruent number.

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, 216381 + ... + 258710.

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

Almost surely, 210055301015 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 475199.

The product of its (nonzero) digits is 375, while the sum is 21.

Adding to 10055301015 its reverse (51010355001), we get a palindrome (61065656016).

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

Divisors: 1 3 5 15 17 51 83 85 249 255 415 1245 1411 4233 7055 21165 475091 1425273 2375455 7126365 8076547 24229641 39432553 40382735 118297659 121148205 197162765 591488295 670353401 2011060203 3351767005 10055301015