Search a number
-
+
104935019955 = 356995667997
BaseRepresentation
bin110000110111010011…
…1010101010110110011
3101000212002202022221120
41201232213111112303
53204401331114310
6120112333353323
710403246644533
oct1415647252663
9330762668846
10104935019955
11405590a0697
1218406638843
139b840696ac
1451166494c3
152ae2607b70
hex186e9d55b3

104935019955 has 8 divisors (see below), whose sum is σ = 167896031952. Its totient is φ = 55965343968.

The previous prime is 104935019951. The next prime is 104935019963. The reversal of 104935019955 is 559910539401.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 104935019955 - 22 = 104935019951 is a prime.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3497833984 + ... + 3497834013.

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

Almost surely, 2104935019955 is an apocalyptic number.

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

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

104935019955 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 6995668005.

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

The spelling of 104935019955 in words is "one hundred four billion, nine hundred thirty-five million, nineteen thousand, nine hundred fifty-five".

Divisors: 1 3 5 15 6995667997 20987003991 34978339985 104935019955