Base | Representation |
---|---|
bin | 1100100000001… |
… | …01110010110111 |
3 | 21022100112010220 |
4 | 12100011302313 |
5 | 203322200320 |
6 | 14223545423 |
7 | 2412322326 |
oct | 620056267 |
9 | 238315126 |
10 | 104881335 |
11 | 54225999 |
12 | 2b15b273 |
13 | 18962580 |
14 | dd020bd |
15 | 931ae40 |
hex | 6405cb7 |
104881335 has 16 divisors (see below), whose sum is σ = 180718944. Its totient is φ = 51633792.
The previous prime is 104881333. The next prime is 104881367. The reversal of 104881335 is 533188401.
104881335 = T282 + T283 + ... + T866.
It is not a de Polignac number, because 104881335 - 21 = 104881333 is a prime.
It is a super-2 number, since 2×1048813352 = 22000188862764450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104881296 and 104881305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104881333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268732 + ... + 269121.
It is an arithmetic number, because the mean of its divisors is an integer number (11294934).
Almost surely, 2104881335 is an apocalyptic number.
104881335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104881335 is a deficient number, since it is larger than the sum of its proper divisors (75837609).
104881335 is a wasteful number, since it uses less digits than its factorization.
104881335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537874.
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 104881335 is about 10241.1588699717. The cubic root of 104881335 is about 471.5916087673.
The spelling of 104881335 in words is "one hundred four million, eight hundred eighty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •