Search a number
-
+
10149539955 = 354116503317
BaseRepresentation
bin10010111001111010…
…11011000001110011
3222012100011001101020
421130331123001303
5131241240234310
64355043510523
7506341444332
oct113475330163
928170131336
1010149539955
114339172655
121b73088443
13c59987b59
146c3d6bd19
153e609b170
hex25cf5b073

10149539955 has 16 divisors (see below), whose sum is σ = 16635344544. Its totient is φ = 5281061120.

The previous prime is 10149539927. The next prime is 10149539977. The reversal of 10149539955 is 55993594101.

It is not a de Polignac number, because 10149539955 - 212 = 10149535859 is a prime.

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

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

It is an unprimeable number.

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, 8251044 + ... + 8252273.

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

Almost surely, 210149539955 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 16503366.

The product of its (nonzero) digits is 1093500, while the sum is 51.

The spelling of 10149539955 in words is "ten billion, one hundred forty-nine million, five hundred thirty-nine thousand, nine hundred fifty-five".

Divisors: 1 3 5 15 41 123 205 615 16503317 49509951 82516585 247549755 676635997 2029907991 3383179985 10149539955