Base | Representation |
---|---|
bin | 110000101000101101… |
… | …1000001101011010011 |
3 | 100222120222011122211220 |
4 | 1201101123001223103 |
5 | 3202400441114410 |
6 | 115552000140123 |
7 | 10355152004511 |
oct | 1412133015323 |
9 | 328528148756 |
10 | 104445254355 |
11 | 40327694532 |
12 | 182aa607643 |
13 | 9b06758a70 |
14 | 50ab5994b1 |
15 | 2ab4612070 |
hex | 18516c1ad3 |
104445254355 has 32 divisors (see below), whose sum is σ = 186172983360. Its totient is φ = 49646123520.
The previous prime is 104445254327. The next prime is 104445254359. The reversal of 104445254355 is 553452544401.
It is not a de Polignac number, because 104445254355 - 213 = 104445246163 is a prime.
It is a super-2 number, since 2×1044452543552 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104445254359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9229116 + ... + 9240425.
It is an arithmetic number, because the mean of its divisors is an integer number (5817905730).
Almost surely, 2104445254355 is an apocalyptic number.
104445254355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104445254355 is a deficient number, since it is larger than the sum of its proper divisors (81727729005).
104445254355 is a wasteful number, since it uses less digits than its factorization.
104445254355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18469591.
The product of its (nonzero) digits is 960000, while the sum is 42.
Adding to 104445254355 its reverse (553452544401), we get a palindrome (657897798756).
The spelling of 104445254355 in words is "one hundred four billion, four hundred forty-five million, two hundred fifty-four thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •